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 <functional>
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: #include <cstring>
4fd800b3a8 2011-02-23        kinaba: #include <cctype>
4fd800b3a8 2011-02-23        kinaba: using namespace std;
4fd800b3a8 2011-02-23        kinaba: typedef long long LL;
4fd800b3a8 2011-02-23        kinaba: typedef complex<double> CMP;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: static const LL MODVAL = 1234567891;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class TheEncryptionDivOne { public:
4fd800b3a8 2011-02-23        kinaba: 	map<vector<int>, LL> memo;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	int count(string msg, string encMsg)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		// accumulate unused characters
4fd800b3a8 2011-02-23        kinaba: 		char cs[] = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
4fd800b3a8 2011-02-23        kinaba: 		set<char> ori(cs+0, cs+52), enc(cs+0, cs+52);
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<msg.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 			ori.erase(msg[i]), enc.erase(encMsg[i]);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		// obviously-invalid cases
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<msg.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 			if( toupper(msg[i]) == toupper(encMsg[i]) )
4fd800b3a8 2011-02-23        kinaba: 				return 0;
4fd800b3a8 2011-02-23        kinaba: 		if( ori.size() != enc.size() )
4fd800b3a8 2011-02-23        kinaba: 			return 0;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		// count
4fd800b3a8 2011-02-23        kinaba: 		vector<int> s(9);
4fd800b3a8 2011-02-23        kinaba: 		for(char c='a'; c<='z'; ++c)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			int oc = ori.count(c)+ori.count(c+'A'-'a');
4fd800b3a8 2011-02-23        kinaba: 			int ec = enc.count(c)+enc.count(c+'A'-'a');
4fd800b3a8 2011-02-23        kinaba: 			s[oc*3+ec] ++;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return rec(s);
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	LL rec( const vector<int>& s )
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		if( memo.count(s) )
4fd800b3a8 2011-02-23        kinaba: 			return memo[s];
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		for(int a=1; a<=2; ++a)
4fd800b3a8 2011-02-23        kinaba: 		for(int b=0; b<=2; ++b) if( s[a*3+b] )
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			LL val = 0;
4fd800b3a8 2011-02-23        kinaba: 			for(int c=0; c<=2; ++c)
4fd800b3a8 2011-02-23        kinaba: 			for(int d=1; d<=2; ++d) if( s[c*3+d] )
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				vector<int> t = s;
4fd800b3a8 2011-02-23        kinaba: 				t[a*3+b] --;
4fd800b3a8 2011-02-23        kinaba: 				if( LL choices = t[c*3+d]*d )
4fd800b3a8 2011-02-23        kinaba: 				{
4fd800b3a8 2011-02-23        kinaba: 					t[(a-1)*3+b] ++;
4fd800b3a8 2011-02-23        kinaba: 					t[c*3+d]     --;
4fd800b3a8 2011-02-23        kinaba: 					t[c*3+(d-1)] ++;
4fd800b3a8 2011-02-23        kinaba: 					val += choices * rec(t);
4fd800b3a8 2011-02-23        kinaba: 				}
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 			return memo[s] = val%MODVAL;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return 1;
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()
4fd800b3a8 2011-02-23        kinaba:  { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
4fd800b3a8 2011-02-23        kinaba: template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
4fd800b3a8 2011-02-23        kinaba:  { os << "{ ";
4fd800b3a8 2011-02-23        kinaba:    for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
4fd800b3a8 2011-02-23        kinaba:    os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
4fd800b3a8 2011-02-23        kinaba: void verify_case(const int& Expected, const int& Received) {
4fd800b3a8 2011-02-23        kinaba:  bool ok = (Expected == Received);
4fd800b3a8 2011-02-23        kinaba:  if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
4fd800b3a8 2011-02-23        kinaba:  cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
4fd800b3a8 2011-02-23        kinaba: #define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
4fd800b3a8 2011-02-23        kinaba: #define END	 verify_case(_, TheEncryptionDivOne().count(msg, encMsg));}
4fd800b3a8 2011-02-23        kinaba: int main(){
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: CASE(0)
4fd800b3a8 2011-02-23        kinaba: 	string msg = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWX";
4fd800b3a8 2011-02-23        kinaba: 	string encMsg = "cdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	string msg = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWX";
4fd800b3a8 2011-02-23        kinaba: 	string encMsg = "bcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXY";
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	string msg = "topcoder";
4fd800b3a8 2011-02-23        kinaba: 	string encMsg = "TOPCODER";
4fd800b3a8 2011-02-23        kinaba: 	int _ = 0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	string msg = "thisisaveryhardproblem";
4fd800b3a8 2011-02-23        kinaba: 	string encMsg = "nobodywillsolveittoday";
4fd800b3a8 2011-02-23        kinaba: 	int _ = 0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	string msg = "a";
4fd800b3a8 2011-02-23        kinaba: 	string encMsg = "W";
4fd800b3a8 2011-02-23        kinaba: 	int _ = 710479617;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	string msg    = "aMgqyMOaWSyaAxOyvOaRAEajOOAWWAqqAAj";
4fd800b3a8 2011-02-23        kinaba: 	string encMsg = "qKYEnKaqMgnqGWanlaqkGdquaaGMMGEEGGu";
4fd800b3a8 2011-02-23        kinaba: 	int _ = 650838813;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE