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 RouteIntersection { public: 4fd800b3a8 2011-02-23 kinaba: string isValid(int N, vector <int> coords, string moves) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: vector< map<int,int> > route; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: map<int,int> cur; 4fd800b3a8 2011-02-23 kinaba: route.push_back(cur); 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<moves.size(); ++i) { 4fd800b3a8 2011-02-23 kinaba: int c = coords[i]; 4fd800b3a8 2011-02-23 kinaba: int m = moves[i]=='+' ? +1 : -1; 4fd800b3a8 2011-02-23 kinaba: cur[c] += m; 4fd800b3a8 2011-02-23 kinaba: route.push_back(cur); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<route.size(); ++i) 4fd800b3a8 2011-02-23 kinaba: for(int j=i+1; j<route.size(); ++j) 4fd800b3a8 2011-02-23 kinaba: if( is_same(route[i], route[j]) ) 4fd800b3a8 2011-02-23 kinaba: return "NOT VALID"; 4fd800b3a8 2011-02-23 kinaba: return "VALID"; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: bool is_same(map<int,int>& a, map<int,int>& b) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: for(map<int,int>::iterator it=b.begin(); it!=b.end(); ++it) 4fd800b3a8 2011-02-23 kinaba: if( a[it->first] != it->second ) 4fd800b3a8 2011-02-23 kinaba: return false; 4fd800b3a8 2011-02-23 kinaba: return true; 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 string& Expected, const string& 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(_, RouteIntersection().isValid(N, coords, moves));} 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 N = 1; 4fd800b3a8 2011-02-23 kinaba: int coords_[] = {1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> coords(coords_, coords_+sizeof(coords_)/sizeof(*coords_)); 4fd800b3a8 2011-02-23 kinaba: string moves = "+"; 4fd800b3a8 2011-02-23 kinaba: string _ = "VALID"; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: int N = 2; 4fd800b3a8 2011-02-23 kinaba: int coords_[] = {1,2,1,2}; 4fd800b3a8 2011-02-23 kinaba: vector <int> coords(coords_, coords_+sizeof(coords_)/sizeof(*coords_)); 4fd800b3a8 2011-02-23 kinaba: string moves = "++--"; 4fd800b3a8 2011-02-23 kinaba: string _ = "NOT VALID"; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: int N = 3; 4fd800b3a8 2011-02-23 kinaba: int coords_[] = {1,2,3,1,2}; 4fd800b3a8 2011-02-23 kinaba: vector <int> coords(coords_, coords_+sizeof(coords_)/sizeof(*coords_)); 4fd800b3a8 2011-02-23 kinaba: string moves = "+++--"; 4fd800b3a8 2011-02-23 kinaba: string _ = "VALID"; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: int N = 344447; 4fd800b3a8 2011-02-23 kinaba: int coords_[] = {132,51717,628,344447,628,51717,344447,2}; 4fd800b3a8 2011-02-23 kinaba: vector <int> coords(coords_, coords_+sizeof(coords_)/sizeof(*coords_)); 4fd800b3a8 2011-02-23 kinaba: string moves = "+-++-+--"; 4fd800b3a8 2011-02-23 kinaba: string _ = "NOT VALID"; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: int N = 1; 4fd800b3a8 2011-02-23 kinaba: int coords_[] = {1,1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> coords(coords_, coords_+sizeof(coords_)/sizeof(*coords_)); 4fd800b3a8 2011-02-23 kinaba: string moves = "+-"; 4fd800b3a8 2011-02-23 kinaba: string _ = "NOT VALID"; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: int N = 990630; 4fd800b3a8 2011-02-23 kinaba: int coords_[] = {833196,524568,361663,108056,28026,824639,269315,440977,440977,765458, 4fd800b3a8 2011-02-23 kinaba: 988451,242440,948414,130873,773990,765458,130873,28026,853121,553636, 4fd800b3a8 2011-02-23 kinaba: 581069,82254,735536,833196,898562,898562,940783,988451,540613,317306, 4fd800b3a8 2011-02-23 kinaba: 623194,940783,571384,988451,108056,514374,97664}; 4fd800b3a8 2011-02-23 kinaba: vector <int> coords(coords_, coords_+sizeof(coords_)/sizeof(*coords_)); 4fd800b3a8 2011-02-23 kinaba: string moves = "--+---+-+++-+-+---++-++-+---+-+--+-++"; 4fd800b3a8 2011-02-23 kinaba: string _ = "NOT VALID"; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: /* 4fd800b3a8 2011-02-23 kinaba: CASE(6) 4fd800b3a8 2011-02-23 kinaba: int N = ; 4fd800b3a8 2011-02-23 kinaba: int coords_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> coords(coords_, coords_+sizeof(coords_)/sizeof(*coords_)); 4fd800b3a8 2011-02-23 kinaba: string moves = ; 4fd800b3a8 2011-02-23 kinaba: string _ = ; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(7) 4fd800b3a8 2011-02-23 kinaba: int N = ; 4fd800b3a8 2011-02-23 kinaba: int coords_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> coords(coords_, coords_+sizeof(coords_)/sizeof(*coords_)); 4fd800b3a8 2011-02-23 kinaba: string moves = ; 4fd800b3a8 2011-02-23 kinaba: string _ = ; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: */ 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE