//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'
inline int myrand(int l, int r) {
int ret = rand(); ret <<= 15; ret ^= rand();
if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
return os<<"(" <<p.first<<", "<<p.second<<")";
}
const int maxn = 200010;
vector<int> memo[maxn];
int Left(int i) {
if(i < 0) return 0;
if(memo[i].empty()) memo[i] = ask(i);
return memo[i][0];
}
int Right(int i) {
if(i < 0) return 0;
if(memo[i].empty()) memo[i] = ask(i);
return memo[i][1];
}
int Total(int i) {
if(i < 0) return 0;
if(memo[i].empty()) memo[i] = ask(i);
return memo[i][0] + memo[i][1];
}
int find_best(int n) {
if(n <= 5000) { // fix
for(int i = 0; i < n; i++) {
if(Total(i) == 0) {
return i;
}
}
}
int mx_tot = 0, id = -1;
for(int i = 0; i < 1000; i++) { // fix
mx_tot = max(mx_tot, Total(i));
}
int now = 0;
int cnt = 0;
while(now < n) {
while(Total(now) < mx_tot and now < n) {
if(Total(now) == 0) return now;
now++;
cnt++;
//assert(cnt < 2000000);
}
int lo = now, hi = n - 1;
int ret = -1;
while(lo <= hi) {
int mid = lo + hi >> 1;
bool full = ((Left(mid) - Left(now) == 0) and (Total(mid) == mx_tot));
if(!full) {
hi = mid - 1;
} else {
lo = mid + 1;
ret = mid;
}
}
now = ret + 1;
cnt++;
//assert(cnt < 2000000);
}
return 0;
}
Compilation message
prize.cpp: In function 'int myrand(int, int)':
prize.cpp:17:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
^~
prize.cpp:17:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
^~~
prize.cpp: In function 'int find_best(int)':
prize.cpp:70:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int mid = lo + hi >> 1;
~~~^~~~
prize.cpp:53:18: warning: unused variable 'id' [-Wunused-variable]
int mx_tot = 0, id = -1;
^~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
15 ms |
4988 KB |
Output is correct |
| 2 |
Correct |
16 ms |
5072 KB |
Output is correct |
| 3 |
Correct |
15 ms |
5072 KB |
Output is correct |
| 4 |
Correct |
14 ms |
5168 KB |
Output is correct |
| 5 |
Correct |
21 ms |
5224 KB |
Output is correct |
| 6 |
Correct |
17 ms |
5224 KB |
Output is correct |
| 7 |
Correct |
16 ms |
5244 KB |
Output is correct |
| 8 |
Correct |
16 ms |
5244 KB |
Output is correct |
| 9 |
Correct |
16 ms |
5244 KB |
Output is correct |
| 10 |
Correct |
14 ms |
5244 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
15 ms |
5268 KB |
Output is correct |
| 2 |
Correct |
10 ms |
5268 KB |
Output is correct |
| 3 |
Correct |
15 ms |
5272 KB |
Output is correct |
| 4 |
Correct |
15 ms |
5272 KB |
Output is correct |
| 5 |
Correct |
17 ms |
5272 KB |
Output is correct |
| 6 |
Correct |
12 ms |
5272 KB |
Output is correct |
| 7 |
Correct |
15 ms |
5272 KB |
Output is correct |
| 8 |
Correct |
17 ms |
5272 KB |
Output is correct |
| 9 |
Correct |
15 ms |
5272 KB |
Output is correct |
| 10 |
Correct |
12 ms |
5272 KB |
Output is correct |
| 11 |
Correct |
15 ms |
5272 KB |
Output is correct |
| 12 |
Correct |
16 ms |
5272 KB |
Output is correct |
| 13 |
Correct |
17 ms |
5272 KB |
Output is correct |
| 14 |
Correct |
13 ms |
5272 KB |
Output is correct |
| 15 |
Correct |
20 ms |
5308 KB |
Output is correct |
| 16 |
Partially correct |
69 ms |
5564 KB |
Partially correct - number of queries: 7706 |
| 17 |
Correct |
13 ms |
5564 KB |
Output is correct |
| 18 |
Partially correct |
100 ms |
5564 KB |
Partially correct - number of queries: 8866 |
| 19 |
Correct |
11 ms |
5564 KB |
Output is correct |
| 20 |
Correct |
33 ms |
5564 KB |
Output is correct |
| 21 |
Correct |
48 ms |
5564 KB |
Output is correct |
| 22 |
Correct |
18 ms |
5564 KB |
Output is correct |
| 23 |
Correct |
15 ms |
5564 KB |
Output is correct |
| 24 |
Correct |
16 ms |
5564 KB |
Output is correct |
| 25 |
Partially correct |
47 ms |
5564 KB |
Partially correct - number of queries: 5416 |
| 26 |
Partially correct |
63 ms |
5564 KB |
Partially correct - number of queries: 5353 |
| 27 |
Correct |
14 ms |
5564 KB |
Output is correct |
| 28 |
Partially correct |
92 ms |
5564 KB |
Partially correct - number of queries: 8364 |
| 29 |
Partially correct |
65 ms |
5564 KB |
Partially correct - number of queries: 6632 |
| 30 |
Partially correct |
80 ms |
5564 KB |
Partially correct - number of queries: 8796 |
| 31 |
Correct |
15 ms |
5564 KB |
Output is correct |
| 32 |
Correct |
12 ms |
5564 KB |
Output is correct |
| 33 |
Correct |
7 ms |
5564 KB |
Output is correct |
| 34 |
Correct |
21 ms |
5564 KB |
Output is correct |
| 35 |
Correct |
19 ms |
5564 KB |
Output is correct |
| 36 |
Correct |
33 ms |
5564 KB |
Output is correct |
| 37 |
Correct |
17 ms |
5564 KB |
Output is correct |
| 38 |
Correct |
15 ms |
5564 KB |
Output is correct |
| 39 |
Correct |
25 ms |
5564 KB |
Output is correct |
| 40 |
Partially correct |
75 ms |
5564 KB |
Partially correct - number of queries: 7666 |
| 41 |
Partially correct |
51 ms |
5564 KB |
Partially correct - number of queries: 5727 |
| 42 |
Partially correct |
27 ms |
5564 KB |
Partially correct - number of queries: 5727 |
| 43 |
Partially correct |
44 ms |
5564 KB |
Partially correct - number of queries: 5244 |
| 44 |
Correct |
51 ms |
5564 KB |
Output is correct |
| 45 |
Correct |
39 ms |
5564 KB |
Output is correct |
| 46 |
Correct |
11 ms |
5564 KB |
Output is correct |
| 47 |
Correct |
41 ms |
5564 KB |
Output is correct |
| 48 |
Partially correct |
81 ms |
5640 KB |
Partially correct - number of queries: 6822 |
| 49 |
Correct |
16 ms |
5640 KB |
Output is correct |
| 50 |
Partially correct |
86 ms |
5640 KB |
Partially correct - number of queries: 8867 |
| 51 |
Correct |
29 ms |
5640 KB |
Output is correct |
| 52 |
Correct |
16 ms |
5640 KB |
Output is correct |
| 53 |
Correct |
17 ms |
5640 KB |
Output is correct |
| 54 |
Correct |
45 ms |
5640 KB |
Output is correct |
| 55 |
Correct |
11 ms |
5640 KB |
Output is correct |
| 56 |
Partially correct |
78 ms |
5640 KB |
Partially correct - number of queries: 8862 |
| 57 |
Partially correct |
57 ms |
5640 KB |
Partially correct - number of queries: 6727 |
| 58 |
Partially correct |
52 ms |
5640 KB |
Partially correct - number of queries: 6808 |
| 59 |
Partially correct |
51 ms |
5640 KB |
Partially correct - number of queries: 5724 |
| 60 |
Partially correct |
47 ms |
5640 KB |
Partially correct - number of queries: 5359 |
| 61 |
Correct |
18 ms |
5640 KB |
Output is correct |
| 62 |
Correct |
15 ms |
5640 KB |
Output is correct |
| 63 |
Correct |
18 ms |
5640 KB |
Output is correct |
| 64 |
Correct |
13 ms |
5640 KB |
Output is correct |
| 65 |
Correct |
18 ms |
5640 KB |
Output is correct |
| 66 |
Correct |
19 ms |
5640 KB |
Output is correct |
| 67 |
Correct |
11 ms |
5640 KB |
Output is correct |
| 68 |
Correct |
14 ms |
5640 KB |
Output is correct |
| 69 |
Correct |
21 ms |
5640 KB |
Output is correct |
| 70 |
Correct |
13 ms |
5640 KB |
Output is correct |
| 71 |
Partially correct |
67 ms |
5640 KB |
Partially correct - number of queries: 8775 |
| 72 |
Correct |
14 ms |
5640 KB |
Output is correct |
| 73 |
Partially correct |
38 ms |
5640 KB |
Partially correct - number of queries: 8666 |
| 74 |
Partially correct |
86 ms |
5640 KB |
Partially correct - number of queries: 8724 |
| 75 |
Correct |
12 ms |
5640 KB |
Output is correct |
| 76 |
Partially correct |
77 ms |
5640 KB |
Partially correct - number of queries: 7620 |
| 77 |
Partially correct |
89 ms |
5640 KB |
Partially correct - number of queries: 8893 |
| 78 |
Correct |
18 ms |
5640 KB |
Output is correct |
| 79 |
Correct |
27 ms |
5640 KB |
Output is correct |
| 80 |
Partially correct |
93 ms |
5640 KB |
Partially correct - number of queries: 8917 |
| 81 |
Partially correct |
40 ms |
5640 KB |
Partially correct - number of queries: 8932 |
| 82 |
Partially correct |
52 ms |
5640 KB |
Partially correct - number of queries: 8838 |
| 83 |
Correct |
12 ms |
5640 KB |
Output is correct |
| 84 |
Partially correct |
76 ms |
5640 KB |
Partially correct - number of queries: 7429 |
| 85 |
Partially correct |
97 ms |
5640 KB |
Partially correct - number of queries: 8905 |
| 86 |
Correct |
14 ms |
5640 KB |
Output is correct |
| 87 |
Correct |
15 ms |
5640 KB |
Output is correct |
| 88 |
Correct |
10 ms |
5640 KB |
Output is correct |
| 89 |
Correct |
12 ms |
5640 KB |
Output is correct |
| 90 |
Correct |
16 ms |
5640 KB |
Output is correct |
| 91 |
Correct |
15 ms |
5640 KB |
Output is correct |
| 92 |
Correct |
12 ms |
5640 KB |
Output is correct |
| 93 |
Correct |
18 ms |
5640 KB |
Output is correct |
| 94 |
Correct |
21 ms |
5640 KB |
Output is correct |
| 95 |
Correct |
15 ms |
5640 KB |
Output is correct |
| 96 |
Correct |
15 ms |
5640 KB |
Output is correct |
| 97 |
Correct |
10 ms |
5640 KB |
Output is correct |
