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: LL gcd(LL a, LL b) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: while(a) 4fd800b3a8 2011-02-23 kinaba: swap(a, b%=a); 4fd800b3a8 2011-02-23 kinaba: return b; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL lcm(LL a, LL b) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: return a/gcd(a,b)*b; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: class BottlesOnShelf { public: 4fd800b3a8 2011-02-23 kinaba: int getNumBroken(int N, vector <int> left, vector <int> right, vector <int> damage) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: int total = 0; 4fd800b3a8 2011-02-23 kinaba: for(int mask=1; mask<(1<<left.size()); ++mask) 4fd800b3a8 2011-02-23 kinaba: total += (bitcnt(mask)%2==0 ? -1 : +1) * hit(N, left, right, damage, mask); 4fd800b3a8 2011-02-23 kinaba: return total; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: int bitcnt(int m) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: int c = 0; 4fd800b3a8 2011-02-23 kinaba: for(; m; m>>=1) 4fd800b3a8 2011-02-23 kinaba: c += (m&1); 4fd800b3a8 2011-02-23 kinaba: return c; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL ceil(LL x, LL q) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: return (x + q - 1) / q * q; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: int hit(int N, vector <int> left, vector <int> right, vector <int> damage, int mask) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: LL theLeft = 1; 4fd800b3a8 2011-02-23 kinaba: LL theRight = N+1; 4fd800b3a8 2011-02-23 kinaba: LL theDamage = 1; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<left.size(); ++i) 4fd800b3a8 2011-02-23 kinaba: if( mask & (1<<i) ) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: theLeft = max<LL>(theLeft, left[i]); 4fd800b3a8 2011-02-23 kinaba: theRight = min<LL>(theRight, right[i]+1); 4fd800b3a8 2011-02-23 kinaba: theDamage = lcm(theDamage, damage[i]); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: return int( max(0LL, ceil(theRight,theDamage)-ceil(theLeft,theDamage)) / theDamage ); 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(_, BottlesOnShelf().getNumBroken(N, left, right, damage));} 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 = 7; 4fd800b3a8 2011-02-23 kinaba: int left_[] = {1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> left(left_, left_+sizeof(left_)/sizeof(*left_)); 4fd800b3a8 2011-02-23 kinaba: int right_[] = {7}; 4fd800b3a8 2011-02-23 kinaba: vector <int> right(right_, right_+sizeof(right_)/sizeof(*right_)); 4fd800b3a8 2011-02-23 kinaba: int damage_[] = {2}; 4fd800b3a8 2011-02-23 kinaba: vector <int> damage(damage_, damage_+sizeof(damage_)/sizeof(*damage_)); 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: int N = 7; 4fd800b3a8 2011-02-23 kinaba: int left_[] = {1,1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> left(left_, left_+sizeof(left_)/sizeof(*left_)); 4fd800b3a8 2011-02-23 kinaba: int right_[] = {7,7}; 4fd800b3a8 2011-02-23 kinaba: vector <int> right(right_, right_+sizeof(right_)/sizeof(*right_)); 4fd800b3a8 2011-02-23 kinaba: int damage_[] = {2,3}; 4fd800b3a8 2011-02-23 kinaba: vector <int> damage(damage_, damage_+sizeof(damage_)/sizeof(*damage_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 4; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: int N = 7; 4fd800b3a8 2011-02-23 kinaba: int left_[] = {1,1,1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> left(left_, left_+sizeof(left_)/sizeof(*left_)); 4fd800b3a8 2011-02-23 kinaba: int right_[] = {7,7,7}; 4fd800b3a8 2011-02-23 kinaba: vector <int> right(right_, right_+sizeof(right_)/sizeof(*right_)); 4fd800b3a8 2011-02-23 kinaba: int damage_[] = {2,3,6}; 4fd800b3a8 2011-02-23 kinaba: vector <int> damage(damage_, damage_+sizeof(damage_)/sizeof(*damage_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 4; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: int N = 10; 4fd800b3a8 2011-02-23 kinaba: int left_[] = {1,6}; 4fd800b3a8 2011-02-23 kinaba: vector <int> left(left_, left_+sizeof(left_)/sizeof(*left_)); 4fd800b3a8 2011-02-23 kinaba: int right_[] = {5,10}; 4fd800b3a8 2011-02-23 kinaba: vector <int> right(right_, right_+sizeof(right_)/sizeof(*right_)); 4fd800b3a8 2011-02-23 kinaba: int damage_[] = {1,7}; 4fd800b3a8 2011-02-23 kinaba: vector <int> damage(damage_, damage_+sizeof(damage_)/sizeof(*damage_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 6; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: int N = 5; 4fd800b3a8 2011-02-23 kinaba: int left_[] = {4}; 4fd800b3a8 2011-02-23 kinaba: vector <int> left(left_, left_+sizeof(left_)/sizeof(*left_)); 4fd800b3a8 2011-02-23 kinaba: int right_[] = {4}; 4fd800b3a8 2011-02-23 kinaba: vector <int> right(right_, right_+sizeof(right_)/sizeof(*right_)); 4fd800b3a8 2011-02-23 kinaba: int damage_[] = {7}; 4fd800b3a8 2011-02-23 kinaba: vector <int> damage(damage_, damage_+sizeof(damage_)/sizeof(*damage_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 0; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: int N = 1000000000; 4fd800b3a8 2011-02-23 kinaba: int left_[] = {1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> left(left_, left_+sizeof(left_)/sizeof(*left_)); 4fd800b3a8 2011-02-23 kinaba: int right_[] = {1000000000}; 4fd800b3a8 2011-02-23 kinaba: vector <int> right(right_, right_+sizeof(right_)/sizeof(*right_)); 4fd800b3a8 2011-02-23 kinaba: int damage_[] = {1}; 4fd800b3a8 2011-02-23 kinaba: vector <int> damage(damage_, damage_+sizeof(damage_)/sizeof(*damage_)); 4fd800b3a8 2011-02-23 kinaba: int _ = 1000000000; 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 left_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> left(left_, left_+sizeof(left_)/sizeof(*left_)); 4fd800b3a8 2011-02-23 kinaba: int right_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> right(right_, right_+sizeof(right_)/sizeof(*right_)); 4fd800b3a8 2011-02-23 kinaba: int damage_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> damage(damage_, damage_+sizeof(damage_)/sizeof(*damage_)); 4fd800b3a8 2011-02-23 kinaba: int _ = ; 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 left_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> left(left_, left_+sizeof(left_)/sizeof(*left_)); 4fd800b3a8 2011-02-23 kinaba: int right_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> right(right_, right_+sizeof(right_)/sizeof(*right_)); 4fd800b3a8 2011-02-23 kinaba: int damage_[] = ; 4fd800b3a8 2011-02-23 kinaba: vector <int> damage(damage_, damage_+sizeof(damage_)/sizeof(*damage_)); 4fd800b3a8 2011-02-23 kinaba: int _ = ; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: */ 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE