#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
typedef pair<int, int> pii;
int sq, mxcnt, ans;
map<int, int> mp[2];
pii myask(int pos)
{
if(mp[0].count(pos))
return {mp[0][pos], mp[1][pos]};
auto v = ask(pos);
mp[0][pos] = v[0];
mp[1][pos] = v[1];
return {v[0], v[1]};
}
void solve(int st, int dr)
{
if(st > dr) return;
if(ans != -1) return;
auto askst = myask(st);
auto askdr = myask(dr);
int sumst = askst.first + askst.second;
int sumdr = askdr.first + askdr.second;
if(sumst == 0) { ans = st; return; }
if(sumdr == 0) { ans = dr; return; }
if(askst.second == 0 || askdr.first == 0) return;
if(dr - st <= 1) return;
if(sumst != mxcnt)
{
solve(st + 1, dr);
return;
}
if(sumdr != mxcnt)
{
solve(st, dr - 1);
return;
}
int cnt = askdr.first - askst.first;
if(cnt == 0) return;
int lgt = dr - st - 1;
int add = lgt / (cnt + 1);
add = max(add, 1);
solve(st + 1, st + add);
solve(st + add, dr - 1);
}
int find_best(int N)
{
ans = -1;
sq = sqrt(N) + 1;
sq = min(sq, N);
mxcnt = 0;
for(int i = 0; i < sq; i++)
{
auto x = myask(i);
int sum = x.first + x.second;
if(sum == 0) ans = i;
mxcnt = max(mxcnt, sum);
}
solve(0, N - 1);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
256 KB |
Output is correct |
2 |
Correct |
9 ms |
256 KB |
Output is correct |
3 |
Correct |
8 ms |
444 KB |
Output is correct |
4 |
Correct |
7 ms |
256 KB |
Output is correct |
5 |
Correct |
7 ms |
256 KB |
Output is correct |
6 |
Correct |
5 ms |
564 KB |
Output is correct |
7 |
Correct |
7 ms |
256 KB |
Output is correct |
8 |
Correct |
6 ms |
256 KB |
Output is correct |
9 |
Correct |
4 ms |
408 KB |
Output is correct |
10 |
Correct |
7 ms |
304 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
436 KB |
Output is correct |
3 |
Correct |
6 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
408 KB |
Output is correct |
5 |
Correct |
7 ms |
300 KB |
Output is correct |
6 |
Correct |
4 ms |
416 KB |
Output is correct |
7 |
Correct |
4 ms |
544 KB |
Output is correct |
8 |
Correct |
7 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
536 KB |
Output is correct |
10 |
Correct |
6 ms |
256 KB |
Output is correct |
11 |
Correct |
9 ms |
388 KB |
Output is correct |
12 |
Correct |
7 ms |
384 KB |
Output is correct |
13 |
Correct |
10 ms |
376 KB |
Output is correct |
14 |
Correct |
5 ms |
256 KB |
Output is correct |
15 |
Correct |
6 ms |
432 KB |
Output is correct |
16 |
Correct |
44 ms |
640 KB |
Output is correct |
17 |
Correct |
10 ms |
308 KB |
Output is correct |
18 |
Partially correct |
33 ms |
800 KB |
Partially correct - number of queries: 5067 |
19 |
Correct |
9 ms |
256 KB |
Output is correct |
20 |
Correct |
16 ms |
404 KB |
Output is correct |
21 |
Correct |
52 ms |
656 KB |
Output is correct |
22 |
Correct |
13 ms |
504 KB |
Output is correct |
23 |
Correct |
8 ms |
256 KB |
Output is correct |
24 |
Correct |
8 ms |
256 KB |
Output is correct |
25 |
Partially correct |
55 ms |
716 KB |
Partially correct - number of queries: 5638 |
26 |
Partially correct |
50 ms |
800 KB |
Partially correct - number of queries: 5542 |
27 |
Correct |
7 ms |
432 KB |
Output is correct |
28 |
Partially correct |
114 ms |
1216 KB |
Partially correct - number of queries: 9343 |
29 |
Partially correct |
87 ms |
1092 KB |
Partially correct - number of queries: 7494 |
30 |
Partially correct |
62 ms |
752 KB |
Partially correct - number of queries: 5870 |
31 |
Correct |
6 ms |
256 KB |
Output is correct |
32 |
Correct |
17 ms |
376 KB |
Output is correct |
33 |
Correct |
2 ms |
252 KB |
Output is correct |
34 |
Correct |
30 ms |
776 KB |
Output is correct |
35 |
Correct |
11 ms |
304 KB |
Output is correct |
36 |
Correct |
21 ms |
548 KB |
Output is correct |
37 |
Correct |
7 ms |
364 KB |
Output is correct |
38 |
Correct |
6 ms |
256 KB |
Output is correct |
39 |
Correct |
21 ms |
552 KB |
Output is correct |
40 |
Partially correct |
27 ms |
844 KB |
Partially correct - number of queries: 5667 |
41 |
Correct |
28 ms |
504 KB |
Output is correct |
42 |
Correct |
17 ms |
580 KB |
Output is correct |
43 |
Correct |
27 ms |
516 KB |
Output is correct |
44 |
Correct |
42 ms |
684 KB |
Output is correct |
45 |
Correct |
34 ms |
580 KB |
Output is correct |
46 |
Correct |
4 ms |
340 KB |
Output is correct |
47 |
Correct |
45 ms |
672 KB |
Output is correct |
48 |
Correct |
34 ms |
504 KB |
Output is correct |
49 |
Correct |
14 ms |
424 KB |
Output is correct |
50 |
Partially correct |
33 ms |
856 KB |
Partially correct - number of queries: 5397 |
51 |
Correct |
48 ms |
680 KB |
Output is correct |
52 |
Correct |
8 ms |
300 KB |
Output is correct |
53 |
Correct |
8 ms |
304 KB |
Output is correct |
54 |
Correct |
46 ms |
680 KB |
Output is correct |
55 |
Correct |
5 ms |
424 KB |
Output is correct |
56 |
Partially correct |
57 ms |
808 KB |
Partially correct - number of queries: 5607 |
57 |
Partially correct |
84 ms |
1148 KB |
Partially correct - number of queries: 7927 |
58 |
Partially correct |
41 ms |
1004 KB |
Partially correct - number of queries: 8080 |
59 |
Correct |
22 ms |
580 KB |
Output is correct |
60 |
Correct |
41 ms |
700 KB |
Output is correct |
61 |
Correct |
8 ms |
256 KB |
Output is correct |
62 |
Correct |
8 ms |
384 KB |
Output is correct |
63 |
Correct |
5 ms |
368 KB |
Output is correct |
64 |
Correct |
8 ms |
384 KB |
Output is correct |
65 |
Correct |
7 ms |
304 KB |
Output is correct |
66 |
Correct |
5 ms |
412 KB |
Output is correct |
67 |
Correct |
15 ms |
376 KB |
Output is correct |
68 |
Correct |
8 ms |
276 KB |
Output is correct |
69 |
Correct |
8 ms |
396 KB |
Output is correct |
70 |
Correct |
6 ms |
368 KB |
Output is correct |
71 |
Incorrect |
105 ms |
1312 KB |
Incorrect |
72 |
Halted |
0 ms |
0 KB |
- |