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 TheMoviesLevelThreeDivOne { public: 4fd800b3a8 2011-02-23 kinaba: long long find(vector <int> timeJ, vector <int> timeB) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: int N = timeJ.size(); 4fd800b3a8 2011-02-23 kinaba: return (1LL<<N) - quitJ(N, timeJ, timeB) - quitJ(N, timeB, timeJ); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL quitJ(int N, vector<int>& J, vector<int>& B) // # of patterns in which J quits 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: typedef pair<int,int> state; 4fd800b3a8 2011-02-23 kinaba: typedef map<state, LL>::iterator iter; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: map<pair<int,int>, LL> M; 4fd800b3a8 2011-02-23 kinaba: M[state(0,-0x3fffffff)] = 1; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<N; ++i) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: map<state, LL> M2; 4fd800b3a8 2011-02-23 kinaba: for(iter it=M.begin(); it!=M.end(); ++it) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: int sum = it->first.first; 4fd800b3a8 2011-02-23 kinaba: int bound = it->first.second; 4fd800b3a8 2011-02-23 kinaba: LL n = it->second; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: M2[state(sum+J[i], bound-J[i])] += n; // i goes to J 4fd800b3a8 2011-02-23 kinaba: M2[state(sum+J[i]-B[i], max(bound, B[i]-sum))] += n; // i goes to B 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: M2.swap(M); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL cnt = 0; 4fd800b3a8 2011-02-23 kinaba: for(iter it=M.begin(); it!=M.end(); ++it) 4fd800b3a8 2011-02-23 kinaba: if( 0 < it->first.second ) 4fd800b3a8 2011-02-23 kinaba: cnt += it->second; 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 long long& Expected, const long long& 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(_, TheMoviesLevelThreeDivOne().find(timeJ, timeB));} 4fd800b3a8 2011-02-23 kinaba: int main(){ 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: CASE(0) 4fd800b3a8 2011-02-23 kinaba: int timeJ_[] = {4, 4}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeJ(timeJ_, timeJ_+sizeof(timeJ_)/sizeof(*timeJ_)); 4fd800b3a8 2011-02-23 kinaba: int timeB_[] = {4, 4}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeB(timeB_, timeB_+sizeof(timeB_)/sizeof(*timeB_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 2LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: int timeJ_[] = {1, 4}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeJ(timeJ_, timeJ_+sizeof(timeJ_)/sizeof(*timeJ_)); 4fd800b3a8 2011-02-23 kinaba: int timeB_[] = {4, 2}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeB(timeB_, timeB_+sizeof(timeB_)/sizeof(*timeB_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: int timeJ_[] = {10, 10, 10, 10}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeJ(timeJ_, timeJ_+sizeof(timeJ_)/sizeof(*timeJ_)); 4fd800b3a8 2011-02-23 kinaba: int timeB_[] = {1, 1, 1, 10}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeB(timeB_, timeB_+sizeof(timeB_)/sizeof(*timeB_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 3LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: int timeJ_[] = {1, 2, 3, 4, 5, 6, 7}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeJ(timeJ_, timeJ_+sizeof(timeJ_)/sizeof(*timeJ_)); 4fd800b3a8 2011-02-23 kinaba: int timeB_[] = {7, 6, 5, 4, 3, 2, 1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeB(timeB_, timeB_+sizeof(timeB_)/sizeof(*timeB_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 98LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: int timeJ_[] = {8,19,17,5,9,15,10,14,13,11,4,1,18,11,10,8,13,8,20,4,5,3,20,5,16,8,17,6,16,14,1,17,10,17,20,14,13,17,17,19,20,2,17,6,12,4,2}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeJ(timeJ_, timeJ_+sizeof(timeJ_)/sizeof(*timeJ_)); 4fd800b3a8 2011-02-23 kinaba: int timeB_[] = {9,19,6,12,2,13,19,11,9,12,17,6,7,6,1,17,15,8,7,6,10,6,2,20,9,8,3,7,7,14,17,8,2,5,5,12,11,1,2,5,20,16,18,15,16,14,12}; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeB(timeB_, timeB_+sizeof(timeB_)/sizeof(*timeB_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = -1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: /* 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: int timeJ_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeJ(timeJ_, timeJ_+sizeof(timeJ_)/sizeof(*timeJ_)); 4fd800b3a8 2011-02-23 kinaba: int timeB_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> timeB(timeB_, timeB_+sizeof(timeB_)/sizeof(*timeB_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: */ 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE