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: LL comb(LL n, LL k)
4fd800b3a8 2011-02-23        kinaba: {
4fd800b3a8 2011-02-23        kinaba: 	k = min(k, n-k);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	LL c = 1;
4fd800b3a8 2011-02-23        kinaba: 	for(LL i=0; i<k; ++i)
4fd800b3a8 2011-02-23        kinaba: 		c *= n-i, c /= i+1;
4fd800b3a8 2011-02-23        kinaba: 	return c;
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class StarsInGraphs { public:
4fd800b3a8 2011-02-23        kinaba: 	int starnum(LL n, LL C)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		if( n<=2 )
4fd800b3a8 2011-02-23        kinaba: 			return -1;
4fd800b3a8 2011-02-23        kinaba: 		LL sum = 0;
4fd800b3a8 2011-02-23        kinaba: 		for(LL k=3; k<=n; ++k)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			sum += comb(n,k);
4fd800b3a8 2011-02-23        kinaba: 			if( sum > C )
4fd800b3a8 2011-02-23        kinaba: 				return -1;
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return (int) sum;
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	int starryPaths(vector <string> adjacencyMatrix, int C)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		const int N = adjacencyMatrix.size();
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		vector<int> sn;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			sn.push_back( starnum(count(adjacencyMatrix[i].begin(), adjacencyMatrix[i].end(), '1'), C) );
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		vector<int> v;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<N; ++i)
4fd800b3a8 2011-02-23        kinaba: 			if( sn[i] > 0 )
4fd800b3a8 2011-02-23        kinaba: 				v.push_back(i);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		for(int step=0 ;; ++step)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			if( v.empty() )
4fd800b3a8 2011-02-23        kinaba: 				return step;
4fd800b3a8 2011-02-23        kinaba: 			if( step >= 3*N )
4fd800b3a8 2011-02-23        kinaba: 				break; // infinite
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 			vector<int> v2;
4fd800b3a8 2011-02-23        kinaba: 			for(int u=0; u<N; ++u)
4fd800b3a8 2011-02-23        kinaba: 				for(int i=0; i<v.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 					if( adjacencyMatrix[v[i]][u]=='1' && sn[v[i]] <= sn[u] )
4fd800b3a8 2011-02-23        kinaba: 						{v2.push_back(u); break;}
4fd800b3a8 2011-02-23        kinaba: 			v.swap(v2);
4fd800b3a8 2011-02-23        kinaba: 		}
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(_, StarsInGraphs().starryPaths(adjacencyMatrix, C));}
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 adjacencyMatrix_[] = {"01110",
4fd800b3a8 2011-02-23        kinaba:  "10111",
4fd800b3a8 2011-02-23        kinaba:  "00000",
4fd800b3a8 2011-02-23        kinaba:  "00000",
4fd800b3a8 2011-02-23        kinaba:  "00000"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> adjacencyMatrix(adjacencyMatrix_, adjacencyMatrix_+sizeof(adjacencyMatrix_)/sizeof(*adjacencyMatrix_));
4fd800b3a8 2011-02-23        kinaba: 	int C = 1000;
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 adjacencyMatrix_[] = {"01011",
4fd800b3a8 2011-02-23        kinaba:  "00111",
4fd800b3a8 2011-02-23        kinaba:  "10011",
4fd800b3a8 2011-02-23        kinaba:  "00000",
4fd800b3a8 2011-02-23        kinaba:  "00000"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> adjacencyMatrix(adjacencyMatrix_, adjacencyMatrix_+sizeof(adjacencyMatrix_)/sizeof(*adjacencyMatrix_));
4fd800b3a8 2011-02-23        kinaba: 	int C = 1;
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 adjacencyMatrix_[] = {"0111",
4fd800b3a8 2011-02-23        kinaba:  "0000",
4fd800b3a8 2011-02-23        kinaba:  "0000",
4fd800b3a8 2011-02-23        kinaba:  "0000"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> adjacencyMatrix(adjacencyMatrix_, adjacencyMatrix_+sizeof(adjacencyMatrix_)/sizeof(*adjacencyMatrix_));
4fd800b3a8 2011-02-23        kinaba: 	int C = 1;
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 adjacencyMatrix_[] = {"01111",
4fd800b3a8 2011-02-23        kinaba:  "00000",
4fd800b3a8 2011-02-23        kinaba:  "00000",
4fd800b3a8 2011-02-23        kinaba:  "00000",
4fd800b3a8 2011-02-23        kinaba:  "00000"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> adjacencyMatrix(adjacencyMatrix_, adjacencyMatrix_+sizeof(adjacencyMatrix_)/sizeof(*adjacencyMatrix_));
4fd800b3a8 2011-02-23        kinaba: 	int C = 4;
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 adjacencyMatrix_[] = {"010001100",
4fd800b3a8 2011-02-23        kinaba:  "001001100",
4fd800b3a8 2011-02-23        kinaba:  "000101110",
4fd800b3a8 2011-02-23        kinaba:  "000010111",
4fd800b3a8 2011-02-23        kinaba:  "000001111",
4fd800b3a8 2011-02-23        kinaba:  "010000000",
4fd800b3a8 2011-02-23        kinaba:  "000110000",
4fd800b3a8 2011-02-23        kinaba:  "000100001",
4fd800b3a8 2011-02-23        kinaba:  "100001000"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> adjacencyMatrix(adjacencyMatrix_, adjacencyMatrix_+sizeof(adjacencyMatrix_)/sizeof(*adjacencyMatrix_));
4fd800b3a8 2011-02-23        kinaba: 	int C = 10;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 5;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	string adjacencyMatrix_[] = {"00","00"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> adjacencyMatrix(adjacencyMatrix_, adjacencyMatrix_+sizeof(adjacencyMatrix_)/sizeof(*adjacencyMatrix_));
4fd800b3a8 2011-02-23        kinaba: 	int C = 9999999;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 0;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	string adjacencyMatrix_[] = {"0111","1011","1101","1110"};
4fd800b3a8 2011-02-23        kinaba: 	  vector <string> adjacencyMatrix(adjacencyMatrix_, adjacencyMatrix_+sizeof(adjacencyMatrix_)/sizeof(*adjacencyMatrix_));
4fd800b3a8 2011-02-23        kinaba: 	int C = 9999;
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE