#include<bits/stdc++.h>
#include "prize.h"
#define pb push_back
#define x first
#define y second
using namespace std;
typedef pair<int, int> ii;
const int maxn = 2e5 + 5;
vector<int> A[maxn];
vector<int> V;
int F = -1;
void check(int x) {
if(A[x][0] + A[x][1] == 0) F = x;
}
void find(int L, int R) {
int lo = L, hi = R - 1;
while(lo <= hi) {
int mid = (lo + hi) / 2;
if(A[mid].size() == 0) A[mid] = ask(mid);
check(mid);
if(F != -1) return;
if(A[mid][0] + A[mid][1] < A[hi + 1][0] + A[hi + 1][1]) {V.pb(mid);return;}
if(A[mid][1] == A[hi + 1][1]) hi = mid - 1;
else lo = mid + 1;
}
}
void solve(int lo, int hi, int R) {
if(lo >= hi) return;
if(R == 0) return;
if(R == 1) {find(lo, hi);return;}
int mid = (lo + hi) / 2;
int mid1 = mid;
while(1) {
if(A[mid1].size() == 0) A[mid1] = ask(mid1);
check(mid);
if(F != -1) return;
if(A[mid1][0] + A[mid1][1] < A[hi][0] + A[hi][1]) V.pb(mid1), mid1--;
else break;
if(mid1 < lo) break;
}
int R1, R2;
if(mid1 == -1) R2 = R - (mid - mid1);
else R2 = A[mid1][1] - A[hi][1] - (mid - mid1);
R1 = R - R2;
solve(lo, mid1, R1);
solve(mid + 1, hi, R2);
}
int find_best(int n) {
if(n <= 5000) {
for(int i = 0;i < n;i++) {
A[i] = ask(i);
if(A[i][0] + A[i][1] == 0) return i;
}
}
int pos = -1;
int s = 470;
for(int i = n - 1;i >= n - s;i--) {
A[i] = ask(i);
check(i);
if(F != -1) return F;
if(pos == -1 || A[i][0] + A[i][1] > A[pos][0] + A[pos][1])
pos = i;
}
for(int i = pos + 1;i < n;i++) V.pb(i);
solve(0, pos, A[pos][0]);
return F;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
4944 KB |
Output is correct |
| 2 |
Correct |
4 ms |
5004 KB |
Output is correct |
| 3 |
Correct |
7 ms |
4996 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4988 KB |
Output is correct |
| 5 |
Correct |
6 ms |
4944 KB |
Output is correct |
| 6 |
Correct |
5 ms |
5000 KB |
Output is correct |
| 7 |
Correct |
7 ms |
5008 KB |
Output is correct |
| 8 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 9 |
Correct |
7 ms |
4944 KB |
Output is correct |
| 10 |
Correct |
6 ms |
4944 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
5000 KB |
Output is correct |
| 2 |
Correct |
7 ms |
4944 KB |
Output is correct |
| 3 |
Correct |
5 ms |
5008 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4988 KB |
Output is correct |
| 5 |
Correct |
7 ms |
4988 KB |
Output is correct |
| 6 |
Correct |
6 ms |
4944 KB |
Output is correct |
| 7 |
Correct |
7 ms |
5008 KB |
Output is correct |
| 8 |
Correct |
4 ms |
4988 KB |
Output is correct |
| 9 |
Correct |
6 ms |
4944 KB |
Output is correct |
| 10 |
Correct |
6 ms |
4944 KB |
Output is correct |
| 11 |
Correct |
7 ms |
5004 KB |
Output is correct |
| 12 |
Correct |
8 ms |
4980 KB |
Output is correct |
| 13 |
Correct |
7 ms |
5012 KB |
Output is correct |
| 14 |
Correct |
8 ms |
4944 KB |
Output is correct |
| 15 |
Correct |
14 ms |
4980 KB |
Output is correct |
| 16 |
Correct |
35 ms |
4988 KB |
Output is correct |
| 17 |
Correct |
7 ms |
5112 KB |
Output is correct |
| 18 |
Correct |
9 ms |
4984 KB |
Output is correct |
| 19 |
Correct |
8 ms |
4984 KB |
Output is correct |
| 20 |
Correct |
17 ms |
4996 KB |
Output is correct |
| 21 |
Correct |
17 ms |
5260 KB |
Output is correct |
| 22 |
Correct |
6 ms |
5016 KB |
Output is correct |
| 23 |
Correct |
8 ms |
4944 KB |
Output is correct |
| 24 |
Correct |
8 ms |
4988 KB |
Output is correct |
| 25 |
Correct |
23 ms |
5032 KB |
Output is correct |
| 26 |
Correct |
30 ms |
5036 KB |
Output is correct |
| 27 |
Correct |
9 ms |
4944 KB |
Output is correct |
| 28 |
Correct |
42 ms |
5100 KB |
Output is correct |
| 29 |
Correct |
27 ms |
4984 KB |
Output is correct |
| 30 |
Correct |
6 ms |
4984 KB |
Output is correct |
| 31 |
Correct |
6 ms |
5008 KB |
Output is correct |
| 32 |
Correct |
8 ms |
5012 KB |
Output is correct |
| 33 |
Correct |
3 ms |
4944 KB |
Output is correct |
| 34 |
Correct |
18 ms |
4992 KB |
Output is correct |
| 35 |
Correct |
5 ms |
4996 KB |
Output is correct |
| 36 |
Correct |
14 ms |
4944 KB |
Output is correct |
| 37 |
Correct |
8 ms |
4992 KB |
Output is correct |
| 38 |
Correct |
8 ms |
5012 KB |
Output is correct |
| 39 |
Correct |
20 ms |
4944 KB |
Output is correct |
| 40 |
Correct |
34 ms |
5088 KB |
Output is correct |
| 41 |
Correct |
13 ms |
5056 KB |
Output is correct |
| 42 |
Correct |
26 ms |
5052 KB |
Output is correct |
| 43 |
Correct |
16 ms |
4980 KB |
Output is correct |
| 44 |
Correct |
14 ms |
4992 KB |
Output is correct |
| 45 |
Correct |
15 ms |
5008 KB |
Output is correct |
| 46 |
Correct |
7 ms |
4944 KB |
Output is correct |
| 47 |
Correct |
27 ms |
5004 KB |
Output is correct |
| 48 |
Correct |
29 ms |
4984 KB |
Output is correct |
| 49 |
Correct |
9 ms |
4984 KB |
Output is correct |
| 50 |
Correct |
5 ms |
5000 KB |
Output is correct |
| 51 |
Correct |
22 ms |
5020 KB |
Output is correct |
| 52 |
Correct |
7 ms |
4944 KB |
Output is correct |
| 53 |
Correct |
8 ms |
4980 KB |
Output is correct |
| 54 |
Correct |
11 ms |
5036 KB |
Output is correct |
| 55 |
Correct |
6 ms |
4944 KB |
Output is correct |
| 56 |
Correct |
5 ms |
4944 KB |
Output is correct |
| 57 |
Correct |
28 ms |
4980 KB |
Output is correct |
| 58 |
Correct |
15 ms |
5176 KB |
Output is correct |
| 59 |
Correct |
19 ms |
5056 KB |
Output is correct |
| 60 |
Correct |
26 ms |
4980 KB |
Output is correct |
| 61 |
Correct |
7 ms |
4988 KB |
Output is correct |
| 62 |
Correct |
7 ms |
4980 KB |
Output is correct |
| 63 |
Correct |
7 ms |
4992 KB |
Output is correct |
| 64 |
Correct |
8 ms |
4988 KB |
Output is correct |
| 65 |
Correct |
3 ms |
4944 KB |
Output is correct |
| 66 |
Correct |
3 ms |
4988 KB |
Output is correct |
| 67 |
Correct |
7 ms |
4996 KB |
Output is correct |
| 68 |
Correct |
7 ms |
5004 KB |
Output is correct |
| 69 |
Correct |
3 ms |
4992 KB |
Output is correct |
| 70 |
Correct |
7 ms |
4996 KB |
Output is correct |
| 71 |
Partially correct |
45 ms |
5028 KB |
Partially correct - number of queries: 5228 |
| 72 |
Correct |
9 ms |
5012 KB |
Output is correct |
| 73 |
Partially correct |
41 ms |
5036 KB |
Partially correct - number of queries: 5165 |
| 74 |
Partially correct |
47 ms |
5252 KB |
Partially correct - number of queries: 5192 |
| 75 |
Correct |
8 ms |
4944 KB |
Output is correct |
| 76 |
Correct |
37 ms |
5080 KB |
Output is correct |
| 77 |
Correct |
43 ms |
5064 KB |
Output is correct |
| 78 |
Correct |
12 ms |
4944 KB |
Output is correct |
| 79 |
Correct |
21 ms |
4944 KB |
Output is correct |
| 80 |
Correct |
52 ms |
5008 KB |
Output is correct |
| 81 |
Correct |
43 ms |
5200 KB |
Output is correct |
| 82 |
Correct |
41 ms |
5132 KB |
Output is correct |
| 83 |
Correct |
8 ms |
4944 KB |
Output is correct |
| 84 |
Correct |
40 ms |
5112 KB |
Output is correct |
| 85 |
Correct |
48 ms |
5048 KB |
Output is correct |
| 86 |
Correct |
7 ms |
4988 KB |
Output is correct |
| 87 |
Correct |
5 ms |
4944 KB |
Output is correct |
| 88 |
Correct |
7 ms |
4988 KB |
Output is correct |
| 89 |
Correct |
6 ms |
5072 KB |
Output is correct |
| 90 |
Correct |
7 ms |
5004 KB |
Output is correct |
| 91 |
Correct |
7 ms |
4944 KB |
Output is correct |
| 92 |
Correct |
5 ms |
4944 KB |
Output is correct |
| 93 |
Correct |
8 ms |
4944 KB |
Output is correct |
| 94 |
Correct |
9 ms |
5020 KB |
Output is correct |
| 95 |
Correct |
9 ms |
5020 KB |
Output is correct |
| 96 |
Correct |
9 ms |
5028 KB |
Output is correct |
| 97 |
Correct |
7 ms |
5012 KB |
Output is correct |
