#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
const int bont = 511;
int ert = 0;
int megold(int l, int r, vector<int> ansl, vector<int> ansr){
if(l+1 >= r) return -1;
int m1 = (l+r)/2;
int m2 = m1;
vector<int> ans = ask(m1);
if(ans[0] + ans[1] == 0) return m1;
vector<int> ans2 = ans;
while(m1-1 > l && ans[0]+ans[1] != ert){
m1--;
ans = ask(m1);
if(ans[0] + ans[1] == 0) return m1;
}
while(m2+1 < r && ans2[0]+ans2[1] != ert){
m2++;
ans2 = ask(m2);
if(ans2[0] + ans2[1] == 0) return m2;
}
return max((ansl[0] < ans[0] ? megold(l, m1, ansl, ans) : -1), (ans2[0] < ansr[0] ? megold(m2, r, ans2, ansr) : -1));
}
int find_best(int n) {
int s = 500;
for(int i = 0; i < min(n, 500); i++){
vector<int> ans = ask(i);
if(ans[0]+ans[1] == 0) return i;
ert = max(ert, ans[0]+ans[1]);
}
vector<int> ans = ask(s);
while(s < n){
if(ans[0]+ans[1] == 0)
return s;
while(ans[0]+ans[1] != ert){
s++;
ans = ask(s);
if(ans[0]+ans[1] == 0)
return s;
}
int e = min(s+bont, n-1);
int s2 = e+1;
vector<int> ans2 = ask(e);
if(ans2[0]+ans2[1] == 0)
return e;
while(s < e && ans2[0]+ans2[1] != ert){
e--;
ans2 = ask(e);
if(ans2[0]+ans2[1] == 0)
return e;
}
if(ans[0] < ans2[0]){
int temp = megold(s, e, ans, ans2);
if(temp != -1)
return temp;
}
s = s2;
if(e == s-1){
ans = ans2;
s--;
}
}
return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
200 KB |
Output is correct |
2 |
Correct |
11 ms |
284 KB |
Output is correct |
3 |
Correct |
10 ms |
200 KB |
Output is correct |
4 |
Correct |
13 ms |
200 KB |
Output is correct |
5 |
Correct |
11 ms |
280 KB |
Output is correct |
6 |
Correct |
1 ms |
280 KB |
Output is correct |
7 |
Correct |
8 ms |
200 KB |
Output is correct |
8 |
Correct |
6 ms |
200 KB |
Output is correct |
9 |
Correct |
5 ms |
328 KB |
Output is correct |
10 |
Correct |
8 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
264 KB |
Output is correct |
2 |
Correct |
11 ms |
264 KB |
Output is correct |
3 |
Correct |
8 ms |
264 KB |
Output is correct |
4 |
Correct |
6 ms |
288 KB |
Output is correct |
5 |
Correct |
10 ms |
200 KB |
Output is correct |
6 |
Correct |
1 ms |
200 KB |
Output is correct |
7 |
Correct |
7 ms |
200 KB |
Output is correct |
8 |
Correct |
12 ms |
284 KB |
Output is correct |
9 |
Correct |
10 ms |
280 KB |
Output is correct |
10 |
Correct |
16 ms |
200 KB |
Output is correct |
11 |
Correct |
10 ms |
200 KB |
Output is correct |
12 |
Correct |
6 ms |
200 KB |
Output is correct |
13 |
Correct |
8 ms |
200 KB |
Output is correct |
14 |
Correct |
9 ms |
200 KB |
Output is correct |
15 |
Correct |
12 ms |
284 KB |
Output is correct |
16 |
Correct |
54 ms |
280 KB |
Output is correct |
17 |
Correct |
6 ms |
200 KB |
Output is correct |
18 |
Partially correct |
58 ms |
200 KB |
Partially correct - number of queries: 5060 |
19 |
Correct |
4 ms |
200 KB |
Output is correct |
20 |
Correct |
16 ms |
284 KB |
Output is correct |
21 |
Correct |
24 ms |
200 KB |
Output is correct |
22 |
Correct |
9 ms |
200 KB |
Output is correct |
23 |
Correct |
9 ms |
200 KB |
Output is correct |
24 |
Correct |
3 ms |
260 KB |
Output is correct |
25 |
Correct |
25 ms |
200 KB |
Output is correct |
26 |
Correct |
29 ms |
200 KB |
Output is correct |
27 |
Correct |
9 ms |
200 KB |
Output is correct |
28 |
Correct |
57 ms |
200 KB |
Output is correct |
29 |
Correct |
47 ms |
284 KB |
Output is correct |
30 |
Partially correct |
35 ms |
284 KB |
Partially correct - number of queries: 5025 |
31 |
Correct |
6 ms |
264 KB |
Output is correct |
32 |
Correct |
15 ms |
200 KB |
Output is correct |
33 |
Correct |
1 ms |
200 KB |
Output is correct |
34 |
Correct |
24 ms |
284 KB |
Output is correct |
35 |
Correct |
5 ms |
284 KB |
Output is correct |
36 |
Correct |
14 ms |
200 KB |
Output is correct |
37 |
Correct |
8 ms |
200 KB |
Output is correct |
38 |
Correct |
6 ms |
200 KB |
Output is correct |
39 |
Correct |
20 ms |
200 KB |
Output is correct |
40 |
Correct |
44 ms |
200 KB |
Output is correct |
41 |
Correct |
36 ms |
280 KB |
Output is correct |
42 |
Correct |
34 ms |
284 KB |
Output is correct |
43 |
Correct |
14 ms |
272 KB |
Output is correct |
44 |
Correct |
11 ms |
280 KB |
Output is correct |
45 |
Correct |
23 ms |
200 KB |
Output is correct |
46 |
Correct |
6 ms |
280 KB |
Output is correct |
47 |
Correct |
32 ms |
264 KB |
Output is correct |
48 |
Correct |
52 ms |
200 KB |
Output is correct |
49 |
Correct |
5 ms |
284 KB |
Output is correct |
50 |
Partially correct |
61 ms |
200 KB |
Partially correct - number of queries: 5039 |
51 |
Correct |
31 ms |
288 KB |
Output is correct |
52 |
Correct |
3 ms |
272 KB |
Output is correct |
53 |
Correct |
12 ms |
200 KB |
Output is correct |
54 |
Correct |
27 ms |
200 KB |
Output is correct |
55 |
Correct |
3 ms |
284 KB |
Output is correct |
56 |
Partially correct |
45 ms |
280 KB |
Partially correct - number of queries: 5026 |
57 |
Correct |
39 ms |
200 KB |
Output is correct |
58 |
Correct |
22 ms |
276 KB |
Output is correct |
59 |
Correct |
15 ms |
272 KB |
Output is correct |
60 |
Correct |
38 ms |
280 KB |
Output is correct |
61 |
Correct |
13 ms |
200 KB |
Output is correct |
62 |
Correct |
6 ms |
200 KB |
Output is correct |
63 |
Correct |
13 ms |
284 KB |
Output is correct |
64 |
Correct |
10 ms |
200 KB |
Output is correct |
65 |
Correct |
12 ms |
200 KB |
Output is correct |
66 |
Correct |
8 ms |
264 KB |
Output is correct |
67 |
Correct |
6 ms |
280 KB |
Output is correct |
68 |
Correct |
6 ms |
288 KB |
Output is correct |
69 |
Correct |
14 ms |
200 KB |
Output is correct |
70 |
Correct |
5 ms |
320 KB |
Output is correct |
71 |
Partially correct |
43 ms |
200 KB |
Partially correct - number of queries: 5058 |
72 |
Correct |
14 ms |
200 KB |
Output is correct |
73 |
Partially correct |
45 ms |
200 KB |
Partially correct - number of queries: 5002 |
74 |
Partially correct |
42 ms |
200 KB |
Partially correct - number of queries: 5026 |
75 |
Correct |
16 ms |
200 KB |
Output is correct |
76 |
Correct |
65 ms |
200 KB |
Output is correct |
77 |
Partially correct |
63 ms |
200 KB |
Partially correct - number of queries: 5063 |
78 |
Correct |
10 ms |
200 KB |
Output is correct |
79 |
Correct |
22 ms |
200 KB |
Output is correct |
80 |
Partially correct |
63 ms |
200 KB |
Partially correct - number of queries: 5058 |
81 |
Partially correct |
57 ms |
200 KB |
Partially correct - number of queries: 5070 |
82 |
Correct |
45 ms |
200 KB |
Output is correct |
83 |
Correct |
9 ms |
200 KB |
Output is correct |
84 |
Correct |
35 ms |
200 KB |
Output is correct |
85 |
Partially correct |
53 ms |
200 KB |
Partially correct - number of queries: 5054 |
86 |
Correct |
5 ms |
284 KB |
Output is correct |
87 |
Correct |
9 ms |
200 KB |
Output is correct |
88 |
Correct |
6 ms |
328 KB |
Output is correct |
89 |
Correct |
9 ms |
200 KB |
Output is correct |
90 |
Correct |
7 ms |
200 KB |
Output is correct |
91 |
Correct |
11 ms |
200 KB |
Output is correct |
92 |
Correct |
12 ms |
200 KB |
Output is correct |
93 |
Correct |
14 ms |
200 KB |
Output is correct |
94 |
Correct |
13 ms |
200 KB |
Output is correct |
95 |
Correct |
14 ms |
200 KB |
Output is correct |
96 |
Correct |
10 ms |
200 KB |
Output is correct |
97 |
Correct |
12 ms |
200 KB |
Output is correct |