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 RightTriangle { public: 4fd800b3a8 2011-02-23 kinaba: long long triangleCount(int places, int points, int a, int b, int c) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: vector<bool> red(places); 4fd800b3a8 2011-02-23 kinaba: set<int> vacant; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<places; ++i) 4fd800b3a8 2011-02-23 kinaba: vacant.insert(i); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: for(LL n=0; n<points; ++n) { 4fd800b3a8 2011-02-23 kinaba: LL p = (a*n*n + b*n + c) % places; 4fd800b3a8 2011-02-23 kinaba: if( red[p] ) { 4fd800b3a8 2011-02-23 kinaba: set<int>::iterator it = vacant.lower_bound(p); 4fd800b3a8 2011-02-23 kinaba: if( it != vacant.end() ) 4fd800b3a8 2011-02-23 kinaba: p = *it; 4fd800b3a8 2011-02-23 kinaba: else { 4fd800b3a8 2011-02-23 kinaba: it = vacant.lower_bound(0); 4fd800b3a8 2011-02-23 kinaba: p = *it; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: red[p] = true; 4fd800b3a8 2011-02-23 kinaba: vacant.erase(p); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: if( places%2 == 1 ) 4fd800b3a8 2011-02-23 kinaba: return 0; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL result = 0; 4fd800b3a8 2011-02-23 kinaba: for(int a=0,b=a+places/2; b<places; ++a, ++b) 4fd800b3a8 2011-02-23 kinaba: if( red[a] && red[b] ) 4fd800b3a8 2011-02-23 kinaba: result += points-2; 4fd800b3a8 2011-02-23 kinaba: return result; 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(_, RightTriangle().triangleCount(places, points, a, b, c));} 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 places = 9; 4fd800b3a8 2011-02-23 kinaba: int points = 3; 4fd800b3a8 2011-02-23 kinaba: int a = 0; 4fd800b3a8 2011-02-23 kinaba: int b = 3; 4fd800b3a8 2011-02-23 kinaba: int c = 0; 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: int places = 40; 4fd800b3a8 2011-02-23 kinaba: int points = 3; 4fd800b3a8 2011-02-23 kinaba: int a = 5; 4fd800b3a8 2011-02-23 kinaba: int b = 0; 4fd800b3a8 2011-02-23 kinaba: int c = 0; 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 places = 4; 4fd800b3a8 2011-02-23 kinaba: int points = 4; 4fd800b3a8 2011-02-23 kinaba: int a = 16; 4fd800b3a8 2011-02-23 kinaba: int b = 24; 4fd800b3a8 2011-02-23 kinaba: int c = 17; 4fd800b3a8 2011-02-23 kinaba: long long _ = 4LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: int places = 1000000; 4fd800b3a8 2011-02-23 kinaba: int points = 47000; 4fd800b3a8 2011-02-23 kinaba: int a = 0; 4fd800b3a8 2011-02-23 kinaba: int b = 2; 4fd800b3a8 2011-02-23 kinaba: int c = 5; 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: int places = 200000; 4fd800b3a8 2011-02-23 kinaba: int points = 700; 4fd800b3a8 2011-02-23 kinaba: int a = 123456; 4fd800b3a8 2011-02-23 kinaba: int b = 789012; 4fd800b3a8 2011-02-23 kinaba: int c = 345678; 4fd800b3a8 2011-02-23 kinaba: long long _ = 6980LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: int places = 1000000; 4fd800b3a8 2011-02-23 kinaba: int points = 0; 4fd800b3a8 2011-02-23 kinaba: int a = 0; 4fd800b3a8 2011-02-23 kinaba: int b = 0; 4fd800b3a8 2011-02-23 kinaba: int c = 0; 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(6) 4fd800b3a8 2011-02-23 kinaba: int places = 1000000; 4fd800b3a8 2011-02-23 kinaba: int points = 100000; 4fd800b3a8 2011-02-23 kinaba: int a = 0; 4fd800b3a8 2011-02-23 kinaba: int b = 0; 4fd800b3a8 2011-02-23 kinaba: int c = 0; 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(7) 4fd800b3a8 2011-02-23 kinaba: int places = 1; 4fd800b3a8 2011-02-23 kinaba: int points = 0; 4fd800b3a8 2011-02-23 kinaba: int a = 1; 4fd800b3a8 2011-02-23 kinaba: int b = 2; 4fd800b3a8 2011-02-23 kinaba: int c = 3; 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(8) 4fd800b3a8 2011-02-23 kinaba: int places = 1; 4fd800b3a8 2011-02-23 kinaba: int points = 1; 4fd800b3a8 2011-02-23 kinaba: int a = 3; 4fd800b3a8 2011-02-23 kinaba: int b = 2; 4fd800b3a8 2011-02-23 kinaba: int c = 1; 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(9) 4fd800b3a8 2011-02-23 kinaba: int places = 3; 4fd800b3a8 2011-02-23 kinaba: int points = 3; 4fd800b3a8 2011-02-23 kinaba: int a = 1000000; 4fd800b3a8 2011-02-23 kinaba: int b = 1000000; 4fd800b3a8 2011-02-23 kinaba: int c = 1000000; 4fd800b3a8 2011-02-23 kinaba: long long _ = 0LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(9) 4fd800b3a8 2011-02-23 kinaba: int places = 4; 4fd800b3a8 2011-02-23 kinaba: int points = 4; 4fd800b3a8 2011-02-23 kinaba: int a = 1000000; 4fd800b3a8 2011-02-23 kinaba: int b = 1000000; 4fd800b3a8 2011-02-23 kinaba: int c = 1000000; 4fd800b3a8 2011-02-23 kinaba: long long _ = 4LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE