#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mp make_pair
#define maxn 200010
int blk;
int qs[maxn][2];
int numqueries = 0;
pii query(int spot) {
if (qs[spot][0] != -1)
return pii(qs[spot][0], qs[spot][1]);
numqueries++;
assert(numqueries <= 10000); //induce run time error instead of WA
vector<int> res = ask(spot);
qs[spot][0] = res[0];
qs[spot][1] = res[1];
return pii(res[0], res[1]);
}
queue<pair<pii, pii>> q;
int find_best(int n) {
//we don't really care what happens for smaller n,
// b/c it is not a function of n
for (int i = 0; i < n; i++) {
qs[i][0] = qs[i][1] = -1;
}
blk = sqrt(n)+5;
blk = min(blk, n); //just making sure
int mxind = -1;
int mxstuff = -1;
for(int i = 0; i < blk; i++) {
pii res = query(i);
if(res.first + res.second == 0)
return i; //this will always be there
if (res.first+ res.second >= mxstuff) {
mxstuff = res.first + res.second;
mxind = i;
}
}
int aft = query(mxind).second;
int numtot = mxstuff; //total number less than biggest guy
int nc = 0;
for (int i = 0; i < blk; i++) {
pii cur = query(i);
if (cur.first + cur.second != mxstuff) nc++;
}
q.push(mp(mp(blk, n-1), mp(nc, 0)));
//gives number to left & right of range
while (q.size()) {
auto cur = q.front(); q.pop();
int cleft = cur.first.first;
int cright = cur.first.second;
if (cleft > cright) continue; //why would we care
int numtoleft = cur.second.first;
int numtoright = cur.second.second;
if (numtoleft + numtoright == numtot) continue; //why bother
if (cleft == cright) {
pii cur = query(cleft);
if (cur.first + cur.second == 0) return cleft;
continue;
}
bool done = false;
int mid = (cleft + cright)/2;
int omid = mid;
int tookout = 0;
while (mid != cright+1) {
pii cur = query(mid);
if (cur.first + cur.second == numtot) {
q.push(mp(mp(cleft, omid-1),
mp(numtoleft, cur.second + tookout)));
q.push(mp(mp(mid+1, cright),
mp(cur.first, numtoright)));
done = true;
break;
}
else {
tookout++;
if (cur.first + cur.second == 0) return mid;
mid++;
}
}
if (done) continue;
mid = omid-1;
while (mid != cleft-1) {
pii cur = query(mid);
if (cur.first + cur.second == numtot) {
q.push(mp(mp(cleft , mid-1),
mp(numtoleft, cur.second)));
done = true;
break;
}
else {
if (cur.first + cur.second == 0) return mid;
mid--;
}
}
}
return 0;
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:47:6: warning: unused variable 'aft' [-Wunused-variable]
int aft = query(mxind).second;
^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
1912 KB |
Output is correct |
| 2 |
Correct |
6 ms |
1912 KB |
Output is correct |
| 3 |
Correct |
5 ms |
2068 KB |
Output is correct |
| 4 |
Correct |
7 ms |
2068 KB |
Output is correct |
| 5 |
Correct |
7 ms |
2068 KB |
Output is correct |
| 6 |
Correct |
4 ms |
2068 KB |
Output is correct |
| 7 |
Correct |
7 ms |
2068 KB |
Output is correct |
| 8 |
Correct |
7 ms |
2068 KB |
Output is correct |
| 9 |
Correct |
7 ms |
2068 KB |
Output is correct |
| 10 |
Correct |
7 ms |
2068 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
2104 KB |
Output is correct |
| 2 |
Correct |
7 ms |
2104 KB |
Output is correct |
| 3 |
Correct |
5 ms |
2104 KB |
Output is correct |
| 4 |
Correct |
6 ms |
2104 KB |
Output is correct |
| 5 |
Correct |
5 ms |
2104 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2104 KB |
Output is correct |
| 7 |
Correct |
5 ms |
2108 KB |
Output is correct |
| 8 |
Correct |
7 ms |
2108 KB |
Output is correct |
| 9 |
Correct |
6 ms |
2108 KB |
Output is correct |
| 10 |
Correct |
6 ms |
2108 KB |
Output is correct |
| 11 |
Correct |
6 ms |
2140 KB |
Output is correct |
| 12 |
Correct |
9 ms |
2140 KB |
Output is correct |
| 13 |
Correct |
7 ms |
2140 KB |
Output is correct |
| 14 |
Correct |
6 ms |
2140 KB |
Output is correct |
| 15 |
Correct |
29 ms |
2140 KB |
Output is correct |
| 16 |
Correct |
31 ms |
2140 KB |
Output is correct |
| 17 |
Correct |
6 ms |
2140 KB |
Output is correct |
| 18 |
Correct |
37 ms |
2140 KB |
Output is correct |
| 19 |
Correct |
6 ms |
2140 KB |
Output is correct |
| 20 |
Correct |
22 ms |
2140 KB |
Output is correct |
| 21 |
Correct |
22 ms |
2140 KB |
Output is correct |
| 22 |
Correct |
24 ms |
2140 KB |
Output is correct |
| 23 |
Correct |
6 ms |
2140 KB |
Output is correct |
| 24 |
Correct |
9 ms |
2140 KB |
Output is correct |
| 25 |
Correct |
20 ms |
2140 KB |
Output is correct |
| 26 |
Correct |
31 ms |
2140 KB |
Output is correct |
| 27 |
Correct |
9 ms |
2140 KB |
Output is correct |
| 28 |
Correct |
25 ms |
2236 KB |
Output is correct |
| 29 |
Correct |
18 ms |
2236 KB |
Output is correct |
| 30 |
Correct |
35 ms |
2236 KB |
Output is correct |
| 31 |
Correct |
6 ms |
2236 KB |
Output is correct |
| 32 |
Correct |
7 ms |
2236 KB |
Output is correct |
| 33 |
Correct |
2 ms |
2236 KB |
Output is correct |
| 34 |
Correct |
39 ms |
2236 KB |
Output is correct |
| 35 |
Correct |
9 ms |
2236 KB |
Output is correct |
| 36 |
Correct |
34 ms |
2236 KB |
Output is correct |
| 37 |
Correct |
8 ms |
2236 KB |
Output is correct |
| 38 |
Correct |
8 ms |
2236 KB |
Output is correct |
| 39 |
Correct |
29 ms |
2236 KB |
Output is correct |
| 40 |
Correct |
33 ms |
2236 KB |
Output is correct |
| 41 |
Correct |
26 ms |
2236 KB |
Output is correct |
| 42 |
Correct |
21 ms |
2236 KB |
Output is correct |
| 43 |
Correct |
33 ms |
2236 KB |
Output is correct |
| 44 |
Correct |
28 ms |
2236 KB |
Output is correct |
| 45 |
Correct |
28 ms |
2236 KB |
Output is correct |
| 46 |
Correct |
7 ms |
2236 KB |
Output is correct |
| 47 |
Correct |
31 ms |
2236 KB |
Output is correct |
| 48 |
Correct |
20 ms |
2236 KB |
Output is correct |
| 49 |
Correct |
31 ms |
2236 KB |
Output is correct |
| 50 |
Correct |
20 ms |
2236 KB |
Output is correct |
| 51 |
Correct |
26 ms |
2236 KB |
Output is correct |
| 52 |
Correct |
36 ms |
2236 KB |
Output is correct |
| 53 |
Correct |
5 ms |
2236 KB |
Output is correct |
| 54 |
Correct |
25 ms |
2236 KB |
Output is correct |
| 55 |
Correct |
6 ms |
2236 KB |
Output is correct |
| 56 |
Correct |
35 ms |
2236 KB |
Output is correct |
| 57 |
Correct |
20 ms |
2236 KB |
Output is correct |
| 58 |
Correct |
32 ms |
2236 KB |
Output is correct |
| 59 |
Correct |
33 ms |
2236 KB |
Output is correct |
| 60 |
Correct |
35 ms |
2236 KB |
Output is correct |
| 61 |
Correct |
7 ms |
2236 KB |
Output is correct |
| 62 |
Correct |
6 ms |
2236 KB |
Output is correct |
| 63 |
Correct |
5 ms |
2236 KB |
Output is correct |
| 64 |
Correct |
5 ms |
2236 KB |
Output is correct |
| 65 |
Correct |
6 ms |
2236 KB |
Output is correct |
| 66 |
Correct |
8 ms |
2236 KB |
Output is correct |
| 67 |
Correct |
7 ms |
2236 KB |
Output is correct |
| 68 |
Correct |
5 ms |
2236 KB |
Output is correct |
| 69 |
Correct |
6 ms |
2236 KB |
Output is correct |
| 70 |
Correct |
8 ms |
2236 KB |
Output is correct |
| 71 |
Partially correct |
38 ms |
2236 KB |
Partially correct - number of queries: 5211 |
| 72 |
Correct |
10 ms |
2236 KB |
Output is correct |
| 73 |
Partially correct |
35 ms |
2236 KB |
Partially correct - number of queries: 5148 |
| 74 |
Partially correct |
43 ms |
2236 KB |
Partially correct - number of queries: 5175 |
| 75 |
Correct |
7 ms |
2236 KB |
Output is correct |
| 76 |
Correct |
33 ms |
2236 KB |
Output is correct |
| 77 |
Correct |
36 ms |
2236 KB |
Output is correct |
| 78 |
Correct |
9 ms |
2236 KB |
Output is correct |
| 79 |
Correct |
26 ms |
2236 KB |
Output is correct |
| 80 |
Correct |
33 ms |
2236 KB |
Output is correct |
| 81 |
Correct |
36 ms |
2236 KB |
Output is correct |
| 82 |
Correct |
39 ms |
2236 KB |
Output is correct |
| 83 |
Correct |
7 ms |
2236 KB |
Output is correct |
| 84 |
Correct |
30 ms |
2236 KB |
Output is correct |
| 85 |
Correct |
37 ms |
2236 KB |
Output is correct |
| 86 |
Runtime error |
64 ms |
3804 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 87 |
Halted |
0 ms |
0 KB |
- |
