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: class AmoebaCode { public:
4fd800b3a8 2011-02-23        kinaba: 	// メインルーチン
4fd800b3a8 2011-02-23        kinaba: 	int find(string code, int K)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		int answer = 1;
4fd800b3a8 2011-02-23        kinaba: 		for(int D=2; D<=K; ++D)
4fd800b3a8 2011-02-23        kinaba: 			if( can(code, K, 0, string(D-1,'X')) ) // 最小距離が D 以上になるようにできる？
4fd800b3a8 2011-02-23        kinaba: 				answer = max(answer, D);
4fd800b3a8 2011-02-23        kinaba: 		return answer; // できるような D の最大値を返す
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 	// 「code[i..$) に 1 〜 K を埋められるか？」を再帰的に判定
4fd800b3a8 2011-02-23        kinaba: 	// prev には code[i] の直前 D-1 文字を入れて呼び出す。
4fd800b3a8 2011-02-23        kinaba: 	// この D-1 文字は避けないと最小距離 D 以上にならないので避けましょう
4fd800b3a8 2011-02-23        kinaba: 	map<pair<size_t,string>, bool> memo;
4fd800b3a8 2011-02-23        kinaba: 	bool can(const string& code, const int K, size_t i, const string& prev)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		if( i == code.size() )
4fd800b3a8 2011-02-23        kinaba: 			return true; // 最後まで埋まった。OK!
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		pair<int,string> key(i, prev);
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: 		// code[i] に入れる文字の候補を列挙
4fd800b3a8 2011-02-23        kinaba: 		vector<char> cand;
4fd800b3a8 2011-02-23        kinaba: 		if( code[i] == '0' ) // '0' なら 1 から K のどれに置き換えてもいい
4fd800b3a8 2011-02-23        kinaba: 			for(int k=1; k<=K; ++k)
4fd800b3a8 2011-02-23        kinaba: 				cand.push_back( char('0'+k) );
4fd800b3a8 2011-02-23        kinaba: 		else // それ以外なら置き換えられない
4fd800b3a8 2011-02-23        kinaba: 			cand.push_back( code[i] );
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		bool ok = false;
4fd800b3a8 2011-02-23        kinaba: 		for(int k=0; k<cand.size(); ++k) // 候補を全部試してみる
4fd800b3a8 2011-02-23        kinaba: 			if( count(prev.begin(), prev.end(), cand[k])    // prev を避けてて
4fd800b3a8 2011-02-23        kinaba: 			 && can(code, K, i+1, prev.substr(1)+cand[k]) ) // code[i+1..$) も全部埋められればOK
4fd800b3a8 2011-02-23        kinaba: 				ok |= true;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		return memo[key] = ok; // メモ化の表に記憶しつつ return
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(_, AmoebaCode().find(code, K));}
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 code = "01";
4fd800b3a8 2011-02-23        kinaba: 	int K = 1;
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 code = "1001";
4fd800b3a8 2011-02-23        kinaba: 	int K = 2;
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 code = "1010";
4fd800b3a8 2011-02-23        kinaba: 	int K = 2;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	string code = "01001";
4fd800b3a8 2011-02-23        kinaba: 	int K = 3;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 3;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	string code = "10012031001";
4fd800b3a8 2011-02-23        kinaba: 	int K = 3;
4fd800b3a8 2011-02-23        kinaba: 	int _ = 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	string code = "00000000000000000000000000000000000000000000000000";
4fd800b3a8 2011-02-23        kinaba: 	int K = 7;
4fd800b3a8 2011-02-23        kinaba: 	int _ = -1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: /*
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	string code = ;
4fd800b3a8 2011-02-23        kinaba: 	int K = ;
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