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: 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: struct UnionFind
4fd800b3a8 2011-02-23        kinaba: {
4fd800b3a8 2011-02-23        kinaba: 	vector<int> uf, sz, cyc;
4fd800b3a8 2011-02-23        kinaba: 	int nc;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	bool operator<(const UnionFind& rhs) const {
4fd800b3a8 2011-02-23        kinaba: 		if( nc != rhs.nc ) return nc < rhs.nc;
4fd800b3a8 2011-02-23        kinaba: 		if( uf != rhs.uf ) return uf < rhs.uf;
4fd800b3a8 2011-02-23        kinaba: 		if( sz != rhs.sz ) return sz < rhs.sz;
4fd800b3a8 2011-02-23        kinaba: 		return cyc < rhs.cyc;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	UnionFind(int N): uf(N), sz(N,1), cyc(N), nc(N)
4fd800b3a8 2011-02-23        kinaba: 		{ for(int i=0; i<N; ++i) uf[i] = i; }
4fd800b3a8 2011-02-23        kinaba: 	int size()
4fd800b3a8 2011-02-23        kinaba: 		{ return nc; }
4fd800b3a8 2011-02-23        kinaba: 	int Find(int a)
4fd800b3a8 2011-02-23        kinaba: 		{ return uf[a]==a ? a : uf[a]=Find(uf[a]); }
4fd800b3a8 2011-02-23        kinaba: 	int Union(int a, int b)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			a = Find(a);
4fd800b3a8 2011-02-23        kinaba: 			b = Find(b);
4fd800b3a8 2011-02-23        kinaba: 			if( a != b )
4fd800b3a8 2011-02-23        kinaba: 			{
4fd800b3a8 2011-02-23        kinaba: 				if( sz[a] >= sz[b] ) swap(a, b);
4fd800b3a8 2011-02-23        kinaba: 				uf[a] = b;
4fd800b3a8 2011-02-23        kinaba: 				sz[b] += sz[a];
4fd800b3a8 2011-02-23        kinaba: 				cyc[b] += cyc[a];
4fd800b3a8 2011-02-23        kinaba: 				--nc;
4fd800b3a8 2011-02-23        kinaba: 			}
4fd800b3a8 2011-02-23        kinaba: 			else
4fd800b3a8 2011-02-23        kinaba: 				cyc[a] ++;
4fd800b3a8 2011-02-23        kinaba: 			return cyc[a];
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: };
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class TheCitiesAndRoadsDivOne { public:
4fd800b3a8 2011-02-23        kinaba: 	int find(vector <string> map)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int N = map.size();
4fd800b3a8 2011-02-23        kinaba: 		UnionFind uf(N);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			for(int j=i+1; j<N; ++j)
4fd800b3a8 2011-02-23        kinaba: 				if( map[i][j]=='Y' )
4fd800b3a8 2011-02-23        kinaba: 					if( uf.Union(i, j) >= 2 )
4fd800b3a8 2011-02-23        kinaba: 						return 0;
4fd800b3a8 2011-02-23        kinaba: 		return rec(uf, 0, 1, N, map);
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	map< pair<UnionFind,int>, int > memo;
4fd800b3a8 2011-02-23        kinaba: 	int rec(UnionFind& uf, int i, int j , int N, vector<string>& map)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		if( i == N )
4fd800b3a8 2011-02-23        kinaba: 			return uf.nc==1 ? 1 : 0;
4fd800b3a8 2011-02-23        kinaba: 		if( j == N )
4fd800b3a8 2011-02-23        kinaba: 			return rec(uf, i+1, i+2, N, map);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		pair<UnionFind,int> key(uf, i*N+j);
4fd800b3a8 2011-02-23        kinaba: 		if( memo.count(key) )
4fd800b3a8 2011-02-23        kinaba: 			return memo[key];
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		LL cnt = rec(uf, i, j+1, N, map);
4fd800b3a8 2011-02-23        kinaba: 		if( map[i][j] == 'N' )
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			UnionFind uf2(uf);
4fd800b3a8 2011-02-23        kinaba: 			if( uf2.Union(i,j) < 2 )
4fd800b3a8 2011-02-23        kinaba: 				cnt = (cnt + rec(uf2,i,j+1,N,map)) % MODVAL;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return memo[key] = (int)cnt;
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(_, TheCitiesAndRoadsDivOne().find(map));}
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 map_[] = {"NN",
4fd800b3a8 2011-02-23        kinaba:  "NN"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	string map_[] = {"NNY",
4fd800b3a8 2011-02-23        kinaba:  "NNN",
4fd800b3a8 2011-02-23        kinaba:  "YNN"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 3;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	string map_[] = {"NY",
4fd800b3a8 2011-02-23        kinaba:  "YN"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	string map_[] = {"NYNN",
4fd800b3a8 2011-02-23        kinaba:  "YNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNY",
4fd800b3a8 2011-02-23        kinaba:  "NNYN"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 10;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	string map_[] = {"NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNNNNNNNNN"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1137797187;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	string map_[] = {"N"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	string map_[] = {"NYYNN",
4fd800b3a8 2011-02-23        kinaba:  "YNYNN",
4fd800b3a8 2011-02-23        kinaba:  "YYNNN",
4fd800b3a8 2011-02-23        kinaba:  "NNNNY",
4fd800b3a8 2011-02-23        kinaba:  "NNNYN"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = 6;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(7)
4fd800b3a8 2011-02-23        kinaba: 	string map_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(8)
4fd800b3a8 2011-02-23        kinaba: 	string map_[] = ;
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> map(map_, map_+sizeof(map_)/sizeof(*map_));
4fd800b3a8 2011-02-23        kinaba: 	int _ = ;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: */
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE