4fd800b3a8 2011-02-23        kinaba: #include <iostream>
4fd800b3a8 2011-02-23        kinaba: #include <sstream>
4fd800b3a8 2011-02-23        kinaba: #include <iomanip>
4fd800b3a8 2011-02-23        kinaba: #include <vector>
4fd800b3a8 2011-02-23        kinaba: #include <string>
4fd800b3a8 2011-02-23        kinaba: #include <map>
4fd800b3a8 2011-02-23        kinaba: #include <set>
4fd800b3a8 2011-02-23        kinaba: #include <algorithm>
4fd800b3a8 2011-02-23        kinaba: #include <numeric>
4fd800b3a8 2011-02-23        kinaba: #include <iterator>
4fd800b3a8 2011-02-23        kinaba: #include <complex>
4fd800b3a8 2011-02-23        kinaba: #include <queue>
4fd800b3a8 2011-02-23        kinaba: #include <stack>
4fd800b3a8 2011-02-23        kinaba: #include <cmath>
4fd800b3a8 2011-02-23        kinaba: #include <cassert>
4fd800b3a8 2011-02-23        kinaba: using namespace std;
4fd800b3a8 2011-02-23        kinaba: typedef long long LL;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class BikeLock
4fd800b3a8 2011-02-23        kinaba: {
4fd800b3a8 2011-02-23        kinaba: public:
4fd800b3a8 2011-02-23        kinaba: 	map<pair<int,string>,int> memo;
4fd800b3a8 2011-02-23        kinaba: 	int minTurns(string current, string desired)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		current += "__";
4fd800b3a8 2011-02-23        kinaba: 		return rec(0, current.size()-2, current, desired);
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	int rec(int i, int N, string& s, const string& d)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		if( i == N )
4fd800b3a8 2011-02-23        kinaba: 			return 0;
4fd800b3a8 2011-02-23        kinaba: 		if( s[i] == d[i] )
4fd800b3a8 2011-02-23        kinaba: 			return rec(i+1, N, s, d);
4fd800b3a8 2011-02-23        kinaba: 		pair<int,string> key( i, s.substr(i,3) );
4fd800b3a8 2011-02-23        kinaba: 		if( memo.count(key) )
4fd800b3a8 2011-02-23        kinaba: 			return memo[key];
4fd800b3a8 2011-02-23        kinaba: 		memo[key] = 9999;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		int ans = 9999;
4fd800b3a8 2011-02-23        kinaba: 		for(int w=1; w<=3; ++w)
4fd800b3a8 2011-02-23        kinaba: 			for(int r=-3; r<=3; ++r) if(r)
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				for(int j=0; j<w; ++j)
4fd800b3a8 2011-02-23        kinaba: 					s[i+j] = (s[i+j]-'0'+10+r)%10+'0';
4fd800b3a8 2011-02-23        kinaba: 				ans = min(ans, 1 + rec(i, N, s, d));
4fd800b3a8 2011-02-23        kinaba: 				for(int j=0; j<w; ++j)
4fd800b3a8 2011-02-23        kinaba: 					s[i+j] = (s[i+j]-'0'+10-r)%10+'0';
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 		return memo[key] = ans;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: };
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: // BEGIN CUT HERE
4fd800b3a8 2011-02-23        kinaba: #include <ctime>
4fd800b3a8 2011-02-23        kinaba: double start_time;string timer() { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
4fd800b3a8 2011-02-23        kinaba: int verify_case(const int &Expected, const int &Received) { if (Expected == Received) cerr << "PASSED" << timer() << endl; else { cerr << "FAILED" << timer() << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } return 0;}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: template<int N> struct Case_ { Case_(){start_time=clock();} };
4fd800b3a8 2011-02-23        kinaba: char Test_(...);
4fd800b3a8 2011-02-23        kinaba: int Test_(Case_<0>) {
4fd800b3a8 2011-02-23        kinaba: 	string current = "555";
4fd800b3a8 2011-02-23        kinaba: 	string desired = "464";
4fd800b3a8 2011-02-23        kinaba: 	int RetVal = 2;
4fd800b3a8 2011-02-23        kinaba: 	return verify_case(RetVal, BikeLock().minTurns(current, desired)); }
4fd800b3a8 2011-02-23        kinaba: int Test_(Case_<1>) {
4fd800b3a8 2011-02-23        kinaba: 	string current = "1234";
4fd800b3a8 2011-02-23        kinaba: 	string desired = "3456";
4fd800b3a8 2011-02-23        kinaba: 	int RetVal = 2;
4fd800b3a8 2011-02-23        kinaba: 	return verify_case(RetVal, BikeLock().minTurns(current, desired)); }
4fd800b3a8 2011-02-23        kinaba: int Test_(Case_<2>) {
4fd800b3a8 2011-02-23        kinaba: 	string current = "06012005";
4fd800b3a8 2011-02-23        kinaba: 	string desired = "06012005";
4fd800b3a8 2011-02-23        kinaba: 	int RetVal = 0;
4fd800b3a8 2011-02-23        kinaba: 	return verify_case(RetVal, BikeLock().minTurns(current, desired)); }
4fd800b3a8 2011-02-23        kinaba: int Test_(Case_<3>) {
4fd800b3a8 2011-02-23        kinaba: 	string current = "123456789";
4fd800b3a8 2011-02-23        kinaba: 	string desired = "567412490";
4fd800b3a8 2011-02-23        kinaba: 	int RetVal = 5;
4fd800b3a8 2011-02-23        kinaba: 	return verify_case(RetVal, BikeLock().minTurns(current, desired)); }
4fd800b3a8 2011-02-23        kinaba: int Test_(Case_<4>) {
4fd800b3a8 2011-02-23        kinaba: 	string current = "23887547676234543215443276347856987698648735634265";
4fd800b3a8 2011-02-23        kinaba: 	string desired = "14327805497625497814327632146531429785698765309822";
4fd800b3a8 2011-02-23        kinaba: 	int RetVal = 34;
4fd800b3a8 2011-02-23        kinaba: 	return verify_case(RetVal, BikeLock().minTurns(current, desired)); }
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: template<int N> void Run_() { cerr << "Test Case #" << N << "..." << flush; Test_(Case_<N>()); Run_<sizeof(Test_(Case_<N+1>()))==1 ? -1 : N+1>(); }
4fd800b3a8 2011-02-23        kinaba: template<>      void Run_<-1>() {}
4fd800b3a8 2011-02-23        kinaba: int main() { Run_<0>(); }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE
4fd800b3a8 2011-02-23        kinaba: