|
| 1 | +#include <iostream> |
| 2 | +#include <sstream> |
| 3 | +#include <vector> |
| 4 | +#include <algorithm> |
| 5 | +#include <set> |
| 6 | +#include <map> |
| 7 | +#include <queue> |
| 8 | +#include <cstring> |
| 9 | +#include <climits> |
| 10 | +#include <cstdio> |
| 11 | +#include <cmath> |
| 12 | +using namespace std; |
| 13 | +typedef vector<int> vi; |
| 14 | +typedef vector<vi> vvi; |
| 15 | +typedef vector<string> vs; |
| 16 | +typedef vector<vs> vvs; |
| 17 | +typedef long long ll; |
| 18 | +typedef pair<ll, ll> pi; |
| 19 | + |
| 20 | + |
| 21 | +class NumberGameAgain{ |
| 22 | + public: |
| 23 | + long long solve(int k, vector<long long> table) { |
| 24 | + sort(table.begin(), table.end()); |
| 25 | + set<pi> S; |
| 26 | + ll r = (1LL << k) - 2; |
| 27 | + // cout<<"r = "<<r<<endl; |
| 28 | + for(ll n : table){ |
| 29 | + ll x = log2(n), l = k-x; |
| 30 | + // cout<<n<<" "<<x<<" "<<l<<endl; |
| 31 | + |
| 32 | + bool done = true; |
| 33 | + for(pi p : S){ |
| 34 | + if(n >= p.first && n <= p.second){ |
| 35 | + done = false; |
| 36 | + break; |
| 37 | + } |
| 38 | + } |
| 39 | + |
| 40 | + if(done){ |
| 41 | + r -= ((1LL << l) - 1); |
| 42 | + ll low = n, high = n; |
| 43 | + S.insert(make_pair(low, high)); |
| 44 | + while(--l){ |
| 45 | + high = 2*high+1; |
| 46 | + low = 2*low; |
| 47 | + // cout<<"[ "<<low<<" , "<<high<<" ]"<<endl; |
| 48 | + S.insert(make_pair(low, high)); |
| 49 | + } |
| 50 | + } |
| 51 | + |
| 52 | + } |
| 53 | + return r; |
| 54 | + } |
| 55 | + |
| 56 | +// BEGIN CUT HERE |
| 57 | + public: |
| 58 | + void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); } |
| 59 | + private: |
| 60 | + template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); } |
| 61 | + void verify_case(int Case, const long long &Expected, const long long &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } } |
| 62 | + void test_case_0() { int Arg0 = 3; long Arr1[] = {2,4,6}; vector<long long> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 2LL; verify_case(0, Arg2, solve(Arg0, Arg1)); } |
| 63 | + void test_case_1() { int Arg0 = 5; long Arr1[] = {2,3}; vector<long long> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 0LL; verify_case(1, Arg2, solve(Arg0, Arg1)); } |
| 64 | + void test_case_2() { int Arg0 = 20; long Arr1[] = {88, 138390, 363924, 18595, 148, 179170, 29, 490195, 28, 67, 533, 980413, 1033224, 227290, 652478, 786172, 27, 5, 768}; vector<long long> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 561093LL; verify_case(2, Arg2, solve(Arg0, Arg1)); } |
| 65 | + void test_case_3() { int Arg0 = 40; long Arr1[] = {2,4,8,16,32141531,2324577,1099511627775,2222222222,33333333333,4444444444,2135}; vector<long long> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 549755748288LL; verify_case(3, Arg2, solve(Arg0, Arg1)); } |
| 66 | + void test_case_4() { int Arg0 = 40; long Arr1[] = {}; vector<long long> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 1099511627774LL; verify_case(4, Arg2, solve(Arg0, Arg1)); } |
| 67 | + |
| 68 | +// END CUT HERE |
| 69 | + |
| 70 | +}; |
| 71 | + |
| 72 | +// BEGIN CUT HERE |
| 73 | +int main(){ |
| 74 | + |
| 75 | + NumberGameAgain ___test; |
| 76 | + ___test.run_test(-1); |
| 77 | +} |
| 78 | +// END CUT HERE |
0 commit comments