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 DoorsGame { public: 4fd800b3a8 2011-02-23 kinaba: int determineOutcome(string doors, int trophy) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: vector<int> score(2<<16); 4fd800b3a8 2011-02-23 kinaba: vector<bool> computed(2<<16); 4fd800b3a8 2011-02-23 kinaba: return rec(score, computed, 0, doors, trophy); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: int rec(vector<int>& score, vector<bool>& computed, int mask, string& doors, int trophy) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: if( computed[mask] ) 4fd800b3a8 2011-02-23 kinaba: return score[mask]; 4fd800b3a8 2011-02-23 kinaba: computed[mask] = true; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: bool Lwin = true; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<trophy; ++i) 4fd800b3a8 2011-02-23 kinaba: if( !(mask & (1<<(doors[i]-'A'))) ) 4fd800b3a8 2011-02-23 kinaba: Lwin = false; 4fd800b3a8 2011-02-23 kinaba: bool Rwin = true; 4fd800b3a8 2011-02-23 kinaba: for(int i=doors.size()-1; i>=trophy; --i) 4fd800b3a8 2011-02-23 kinaba: if( !(mask & (1<<(doors[i]-'A'))) ) 4fd800b3a8 2011-02-23 kinaba: Rwin = false; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: if( Lwin && Rwin ) 4fd800b3a8 2011-02-23 kinaba: return score[mask] = 0; 4fd800b3a8 2011-02-23 kinaba: if( Lwin ) 4fd800b3a8 2011-02-23 kinaba: return score[mask] = +bitcnt(mask); 4fd800b3a8 2011-02-23 kinaba: if( Rwin ) 4fd800b3a8 2011-02-23 kinaba: return score[mask] = -bitcnt(mask); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: vector<int> ss; 4fd800b3a8 2011-02-23 kinaba: for(int c=0; c<16; ++c) 4fd800b3a8 2011-02-23 kinaba: if( !(mask & (1<<c)) ) 4fd800b3a8 2011-02-23 kinaba: ss.push_back( rec(score,computed,mask|(1<<c),doors,trophy) ); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: bool L = !(bitcnt(mask)&1); 4fd800b3a8 2011-02-23 kinaba: if(!L) 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<ss.size(); ++i) 4fd800b3a8 2011-02-23 kinaba: ss[i] = -ss[i]; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: int Ms = *max_element(ss.begin(),ss.end()); 4fd800b3a8 2011-02-23 kinaba: if( Ms == 0 ) 4fd800b3a8 2011-02-23 kinaba: return score[mask] = 0; 4fd800b3a8 2011-02-23 kinaba: if( Ms > 0 ) { 4fd800b3a8 2011-02-23 kinaba: int posMin = 99999; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<ss.size(); ++i) 4fd800b3a8 2011-02-23 kinaba: if(ss[i]>0) 4fd800b3a8 2011-02-23 kinaba: posMin = min(posMin,ss[i]); 4fd800b3a8 2011-02-23 kinaba: return score[mask] = (L ? posMin : -posMin); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: int me = *min_element(ss.begin(), ss.end()); 4fd800b3a8 2011-02-23 kinaba: return score[mask] = (L ? me : -me); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: int bitcnt(int mask) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: int cnt = 0; 4fd800b3a8 2011-02-23 kinaba: for(; mask; mask>>=1) 4fd800b3a8 2011-02-23 kinaba: cnt += mask&1; 4fd800b3a8 2011-02-23 kinaba: return 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(_, DoorsGame().determineOutcome(doors, trophy));} 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 doors = "ABCD"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 2; 4fd800b3a8 2011-02-23 kinaba: int _ = 3; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: string doors = "ABCC"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 2; 4fd800b3a8 2011-02-23 kinaba: int _ = -2; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: string doors = "ABABAB"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 3; 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 doors = "ABAPDCAA"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 5; 4fd800b3a8 2011-02-23 kinaba: int _ = -4; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: string doors = "MOCFDCE"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 3; 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 doors = "ABCCDE"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 3; 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 doors = "ABCCD"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 3; 4fd800b3a8 2011-02-23 kinaba: int _ = 0; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(7) 4fd800b3a8 2011-02-23 kinaba: string doors = "ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPCC"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 25; 4fd800b3a8 2011-02-23 kinaba: int _ = 0; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(8) 4fd800b3a8 2011-02-23 kinaba: string doors = "ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPCC"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 7; 4fd800b3a8 2011-02-23 kinaba: int _ = 0; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(8) 4fd800b3a8 2011-02-23 kinaba: string doors = "AAAAAAAAAAAAAAAAABCDEFGHIJKLMNOPPPPPPPPPPPPPPPPPP"; 4fd800b3a8 2011-02-23 kinaba: int trophy = 25; 4fd800b3a8 2011-02-23 kinaba: int _ = 0; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE