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 OneDimensionalBalls { public: 4fd800b3a8 2011-02-23 kinaba: long long countValidGuesses(vector <int> firstPicture, vector <int> secondPicture) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: LL answer = 0; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: const int N = firstPicture.size(); 4fd800b3a8 2011-02-23 kinaba: set<int> sp(secondPicture.begin(), secondPicture.end()); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: for(set<int>::iterator it=sp.begin(); it!=sp.end(); ++it) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: if( firstPicture[0] != *it ) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: const int d = abs(firstPicture[0] - *it); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: set<int> avail = sp; 4fd800b3a8 2011-02-23 kinaba: avail.erase(*it); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: vector<bool> done(N, false); 4fd800b3a8 2011-02-23 kinaba: done[0] = true; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: for(;;) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: bool upd = false; 4fd800b3a8 2011-02-23 kinaba: for(int k=0; k<N; ++k) 4fd800b3a8 2011-02-23 kinaba: if( !done[k] ) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: bool aL = avail.count(firstPicture[k]-d)>0; 4fd800b3a8 2011-02-23 kinaba: bool aR = avail.count(firstPicture[k]+d)>0; 4fd800b3a8 2011-02-23 kinaba: if( !aL && !aR ) 4fd800b3a8 2011-02-23 kinaba: goto nextIt; 4fd800b3a8 2011-02-23 kinaba: else if( aL && !aR ) 4fd800b3a8 2011-02-23 kinaba: {upd=done[k]=true; avail.erase(firstPicture[k]-d);} 4fd800b3a8 2011-02-23 kinaba: else if( !aL && aR ) 4fd800b3a8 2011-02-23 kinaba: {upd=done[k]=true; avail.erase(firstPicture[k]+d);} 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: if( !upd ) 4fd800b3a8 2011-02-23 kinaba: break; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: set<int> notDone; 4fd800b3a8 2011-02-23 kinaba: for(int k=0; k<N; ++k) 4fd800b3a8 2011-02-23 kinaba: if( !done[k] ) 4fd800b3a8 2011-02-23 kinaba: notDone.insert(firstPicture[k]); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL cnt = 1; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: set<int> nnd; 4fd800b3a8 2011-02-23 kinaba: for(set<int>::iterator jt=notDone.begin(); jt!=notDone.end(); ++jt) 4fd800b3a8 2011-02-23 kinaba: if( !nnd.count(*jt) ) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: int chain = 1; 4fd800b3a8 2011-02-23 kinaba: for(int q=*jt+2*d; notDone.count(q); q+=2*d) 4fd800b3a8 2011-02-23 kinaba: {nnd.insert(q); ++chain;} 4fd800b3a8 2011-02-23 kinaba: cnt *= chain+1; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: answer += cnt; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: nextIt:; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: return answer; 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(_, OneDimensionalBalls().countValidGuesses(firstPicture, secondPicture));} 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 firstPicture_[] = {12,11}; 4fd800b3a8 2011-02-23 kinaba: vector <int> firstPicture(firstPicture_, firstPicture_+sizeof(firstPicture_)/sizeof(*firstPicture_)); 4fd800b3a8 2011-02-23 kinaba: int secondPicture_[] = {10,11,13}; 4fd800b3a8 2011-02-23 kinaba: vector <int> secondPicture(secondPicture_, secondPicture_+sizeof(secondPicture_)/sizeof(*secondPicture_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 3LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: int firstPicture_[] = {1,2,3}; 4fd800b3a8 2011-02-23 kinaba: vector <int> firstPicture(firstPicture_, firstPicture_+sizeof(firstPicture_)/sizeof(*firstPicture_)); 4fd800b3a8 2011-02-23 kinaba: int secondPicture_[] = {1,2,3}; 4fd800b3a8 2011-02-23 kinaba: vector <int> secondPicture(secondPicture_, secondPicture_+sizeof(secondPicture_)/sizeof(*secondPicture_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: int firstPicture_[] = {1,3}; 4fd800b3a8 2011-02-23 kinaba: vector <int> firstPicture(firstPicture_, firstPicture_+sizeof(firstPicture_)/sizeof(*firstPicture_)); 4fd800b3a8 2011-02-23 kinaba: int secondPicture_[] = {1,3}; 4fd800b3a8 2011-02-23 kinaba: vector <int> secondPicture(secondPicture_, secondPicture_+sizeof(secondPicture_)/sizeof(*secondPicture_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: int firstPicture_[] = {7234}; 4fd800b3a8 2011-02-23 kinaba: vector <int> firstPicture(firstPicture_, firstPicture_+sizeof(firstPicture_)/sizeof(*firstPicture_)); 4fd800b3a8 2011-02-23 kinaba: int secondPicture_[] = {6316,689156,689160,689161,800000,1000001}; 4fd800b3a8 2011-02-23 kinaba: vector <int> secondPicture(secondPicture_, secondPicture_+sizeof(secondPicture_)/sizeof(*secondPicture_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 6LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: int firstPicture_[] = {6,2,4}; 4fd800b3a8 2011-02-23 kinaba: vector <int> firstPicture(firstPicture_, firstPicture_+sizeof(firstPicture_)/sizeof(*firstPicture_)); 4fd800b3a8 2011-02-23 kinaba: int secondPicture_[] = {1,2,3,4,5,7,8}; 4fd800b3a8 2011-02-23 kinaba: vector <int> secondPicture(secondPicture_, secondPicture_+sizeof(secondPicture_)/sizeof(*secondPicture_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 7LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: int firstPicture_[] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30}; 4fd800b3a8 2011-02-23 kinaba: vector <int> firstPicture(firstPicture_, firstPicture_+sizeof(firstPicture_)/sizeof(*firstPicture_)); 4fd800b3a8 2011-02-23 kinaba: int secondPicture_[] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30}; 4fd800b3a8 2011-02-23 kinaba: vector <int> secondPicture(secondPicture_, secondPicture_+sizeof(secondPicture_)/sizeof(*secondPicture_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = -1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(6) 4fd800b3a8 2011-02-23 kinaba: int firstPicture_[] = {1,2,3,4}; 4fd800b3a8 2011-02-23 kinaba: vector <int> firstPicture(firstPicture_, firstPicture_+sizeof(firstPicture_)/sizeof(*firstPicture_)); 4fd800b3a8 2011-02-23 kinaba: int secondPicture_[] = {1,2,3,4}; 4fd800b3a8 2011-02-23 kinaba: vector <int> secondPicture(secondPicture_, secondPicture_+sizeof(secondPicture_)/sizeof(*secondPicture_)); 4fd800b3a8 2011-02-23 kinaba: long long _ = 2LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE