#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int cnt;
int L, R;
int solve (int l, int r, int cl, int cr) {
if (l > r || cl + cr == cnt || l > R || r < L)
return 0;
if (l == r) {
vector<int> a = ask(l);
if (a[0] + a[1] == 0)
return l;
if (a[0] + a[1] != cnt) {
if (a[0] == 0)
L = max (L, l + 1);
if (a[1] == 0)
R = min (R, l - 1);
}
return 0;
}
int wef = cl + cr;
int mid = (l + r) >> 1;
int mn = mid, mx = mid;
for (int i = 0; i < cnt - wef; i++) {
int x;
if (i % 2 == 1) {
x = mid + i / 2 + 1;
} else {
x = mid - i / 2;
}
mn = min (mn, x);
mx = max (mx, x);
vector<int> a = ask(x);
if (a[0] + a[1] == 0)
return x;
if (a[0] + a[1] == cnt) {
int ans = 0;
if (x == mn)
ans ^= solve (l, mn - 1, cl, a[1]);
else
ans ^= solve (l, mn - 1, cl, a[1] + i);
if (x == mx)
ans ^= solve (mx + 1, r, a[0], cr);
else
ans ^= solve (mx + 1, r, a[0] + i, cr);
return ans;
}
if (a[0] == 0)
L = max (L, x + 1);
if (a[1] == 0)
R = min (R, x - 1);
}
return 0;
}
int find_best(int n) {
R = n - 1;
L = 0;
for (int i = max (0, n - 400); i < n; i++) {
vector<int> a = ask(i);
if(a[0] + a[1] == 0)
return i;
cnt = max (cnt, a[0] + a[1]);
}
return solve (0, n - 1, 0, 0);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
344 KB |
Output is correct |
| 2 |
Correct |
2 ms |
344 KB |
Output is correct |
| 3 |
Correct |
2 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
2 ms |
344 KB |
Output is correct |
| 6 |
Correct |
2 ms |
344 KB |
Output is correct |
| 7 |
Correct |
2 ms |
344 KB |
Output is correct |
| 8 |
Correct |
2 ms |
344 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
3 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
2 ms |
428 KB |
Output is correct |
| 3 |
Correct |
2 ms |
344 KB |
Output is correct |
| 4 |
Correct |
3 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
2 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
2 ms |
428 KB |
Output is correct |
| 9 |
Correct |
2 ms |
344 KB |
Output is correct |
| 10 |
Correct |
2 ms |
344 KB |
Output is correct |
| 11 |
Correct |
2 ms |
344 KB |
Output is correct |
| 12 |
Correct |
3 ms |
344 KB |
Output is correct |
| 13 |
Correct |
3 ms |
344 KB |
Output is correct |
| 14 |
Correct |
4 ms |
344 KB |
Output is correct |
| 15 |
Correct |
5 ms |
344 KB |
Output is correct |
| 16 |
Correct |
26 ms |
344 KB |
Output is correct |
| 17 |
Correct |
3 ms |
344 KB |
Output is correct |
| 18 |
Correct |
16 ms |
344 KB |
Output is correct |
| 19 |
Correct |
8 ms |
344 KB |
Output is correct |
| 20 |
Correct |
10 ms |
344 KB |
Output is correct |
| 21 |
Correct |
9 ms |
344 KB |
Output is correct |
| 22 |
Correct |
8 ms |
344 KB |
Output is correct |
| 23 |
Correct |
2 ms |
344 KB |
Output is correct |
| 24 |
Correct |
3 ms |
344 KB |
Output is correct |
| 25 |
Correct |
12 ms |
344 KB |
Output is correct |
| 26 |
Correct |
9 ms |
344 KB |
Output is correct |
| 27 |
Correct |
3 ms |
344 KB |
Output is correct |
| 28 |
Correct |
18 ms |
344 KB |
Output is correct |
| 29 |
Correct |
11 ms |
344 KB |
Output is correct |
| 30 |
Correct |
12 ms |
344 KB |
Output is correct |
| 31 |
Correct |
3 ms |
344 KB |
Output is correct |
| 32 |
Correct |
5 ms |
344 KB |
Output is correct |
| 33 |
Correct |
0 ms |
344 KB |
Output is correct |
| 34 |
Correct |
9 ms |
344 KB |
Output is correct |
| 35 |
Correct |
4 ms |
344 KB |
Output is correct |
| 36 |
Correct |
8 ms |
344 KB |
Output is correct |
| 37 |
Correct |
3 ms |
344 KB |
Output is correct |
| 38 |
Correct |
2 ms |
344 KB |
Output is correct |
| 39 |
Correct |
14 ms |
344 KB |
Output is correct |
| 40 |
Correct |
18 ms |
344 KB |
Output is correct |
| 41 |
Correct |
15 ms |
344 KB |
Output is correct |
| 42 |
Correct |
15 ms |
344 KB |
Output is correct |
| 43 |
Correct |
14 ms |
340 KB |
Output is correct |
| 44 |
Correct |
10 ms |
344 KB |
Output is correct |
| 45 |
Correct |
9 ms |
344 KB |
Output is correct |
| 46 |
Correct |
10 ms |
344 KB |
Output is correct |
| 47 |
Correct |
13 ms |
344 KB |
Output is correct |
| 48 |
Correct |
12 ms |
344 KB |
Output is correct |
| 49 |
Correct |
8 ms |
344 KB |
Output is correct |
| 50 |
Correct |
20 ms |
344 KB |
Output is correct |
| 51 |
Correct |
18 ms |
340 KB |
Output is correct |
| 52 |
Correct |
4 ms |
344 KB |
Output is correct |
| 53 |
Correct |
3 ms |
344 KB |
Output is correct |
| 54 |
Correct |
10 ms |
344 KB |
Output is correct |
| 55 |
Correct |
4 ms |
344 KB |
Output is correct |
| 56 |
Correct |
22 ms |
344 KB |
Output is correct |
| 57 |
Correct |
11 ms |
344 KB |
Output is correct |
| 58 |
Correct |
16 ms |
344 KB |
Output is correct |
| 59 |
Correct |
18 ms |
344 KB |
Output is correct |
| 60 |
Correct |
9 ms |
344 KB |
Output is correct |
| 61 |
Correct |
4 ms |
344 KB |
Output is correct |
| 62 |
Correct |
2 ms |
344 KB |
Output is correct |
| 63 |
Correct |
3 ms |
344 KB |
Output is correct |
| 64 |
Correct |
2 ms |
428 KB |
Output is correct |
| 65 |
Correct |
2 ms |
344 KB |
Output is correct |
| 66 |
Correct |
3 ms |
428 KB |
Output is correct |
| 67 |
Incorrect |
2 ms |
344 KB |
answer is not correct |
| 68 |
Halted |
0 ms |
0 KB |
- |
