#include "prize.h"
#include <vector>
#include <algorithm>
using namespace std;
int m, res;
bool flag = false;
void solve(int l, int r, int num, int bef){
if(num == 0) return;
if(l > r) return;
int mid = (l+r)/2;
vector<int> resp = ask(mid);
if(resp[0]+resp[1] == 0){
res = mid;
flag = true;
return;
}
int b = mid;
while(resp[0]+resp[1] != m && b < r){
b++;
resp = ask(b);
if(resp[0]+resp[1] == 0){
res = b;
flag = true;
return;
}
}
if(resp[0]+resp[1] == m){
solve(l, mid-1, resp[0]-(b-mid)-bef, bef);
if(flag) return;
solve(b+1, r, num-(resp[0]-bef), resp[0]);
if(flag) return;
} else{
solve(l, mid-1, num, bef);
}
return;
}
int find_best(int n) {
if(n <= 5000){
for(int i=0; i<n; i++){
vector<int> resp = ask(i);
if(resp[0]+resp[1] == 0) return i;
}
}
vector<int> resp;
for(int i=0; i<470; i++){
resp = ask(i);
if(resp[0]+resp[1] == 0) return i;
m = max(m, resp[0]+resp[1]);
}
solve(0, n-1, m, 0);
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
248 KB |
Output is correct |
2 |
Correct |
4 ms |
480 KB |
Output is correct |
3 |
Correct |
4 ms |
500 KB |
Output is correct |
4 |
Correct |
4 ms |
500 KB |
Output is correct |
5 |
Correct |
4 ms |
500 KB |
Output is correct |
6 |
Correct |
2 ms |
500 KB |
Output is correct |
7 |
Correct |
4 ms |
608 KB |
Output is correct |
8 |
Correct |
7 ms |
608 KB |
Output is correct |
9 |
Correct |
4 ms |
608 KB |
Output is correct |
10 |
Correct |
9 ms |
608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
608 KB |
Output is correct |
2 |
Correct |
7 ms |
608 KB |
Output is correct |
3 |
Correct |
8 ms |
608 KB |
Output is correct |
4 |
Correct |
7 ms |
608 KB |
Output is correct |
5 |
Correct |
7 ms |
608 KB |
Output is correct |
6 |
Correct |
2 ms |
608 KB |
Output is correct |
7 |
Correct |
6 ms |
608 KB |
Output is correct |
8 |
Correct |
8 ms |
608 KB |
Output is correct |
9 |
Correct |
4 ms |
608 KB |
Output is correct |
10 |
Correct |
5 ms |
608 KB |
Output is correct |
11 |
Correct |
9 ms |
608 KB |
Output is correct |
12 |
Correct |
8 ms |
608 KB |
Output is correct |
13 |
Correct |
13 ms |
608 KB |
Output is correct |
14 |
Correct |
9 ms |
608 KB |
Output is correct |
15 |
Correct |
12 ms |
608 KB |
Output is correct |
16 |
Correct |
47 ms |
608 KB |
Output is correct |
17 |
Correct |
7 ms |
608 KB |
Output is correct |
18 |
Correct |
58 ms |
608 KB |
Output is correct |
19 |
Correct |
7 ms |
608 KB |
Output is correct |
20 |
Correct |
18 ms |
608 KB |
Output is correct |
21 |
Correct |
11 ms |
608 KB |
Output is correct |
22 |
Correct |
5 ms |
608 KB |
Output is correct |
23 |
Correct |
4 ms |
608 KB |
Output is correct |
24 |
Correct |
6 ms |
608 KB |
Output is correct |
25 |
Correct |
20 ms |
608 KB |
Output is correct |
26 |
Correct |
26 ms |
608 KB |
Output is correct |
27 |
Correct |
8 ms |
608 KB |
Output is correct |
28 |
Correct |
44 ms |
608 KB |
Output is correct |
29 |
Correct |
17 ms |
608 KB |
Output is correct |
30 |
Correct |
27 ms |
608 KB |
Output is correct |
31 |
Correct |
7 ms |
608 KB |
Output is correct |
32 |
Correct |
9 ms |
608 KB |
Output is correct |
33 |
Correct |
2 ms |
608 KB |
Output is correct |
34 |
Correct |
18 ms |
608 KB |
Output is correct |
35 |
Correct |
9 ms |
608 KB |
Output is correct |
36 |
Correct |
15 ms |
608 KB |
Output is correct |
37 |
Correct |
4 ms |
608 KB |
Output is correct |
38 |
Correct |
7 ms |
608 KB |
Output is correct |
39 |
Correct |
12 ms |
608 KB |
Output is correct |
40 |
Correct |
20 ms |
608 KB |
Output is correct |
41 |
Correct |
15 ms |
608 KB |
Output is correct |
42 |
Correct |
28 ms |
608 KB |
Output is correct |
43 |
Correct |
39 ms |
608 KB |
Output is correct |
44 |
Correct |
11 ms |
608 KB |
Output is correct |
45 |
Correct |
13 ms |
608 KB |
Output is correct |
46 |
Correct |
6 ms |
608 KB |
Output is correct |
47 |
Correct |
24 ms |
608 KB |
Output is correct |
48 |
Correct |
16 ms |
608 KB |
Output is correct |
49 |
Correct |
12 ms |
608 KB |
Output is correct |
50 |
Correct |
51 ms |
608 KB |
Output is correct |
51 |
Correct |
26 ms |
608 KB |
Output is correct |
52 |
Correct |
6 ms |
608 KB |
Output is correct |
53 |
Correct |
7 ms |
608 KB |
Output is correct |
54 |
Correct |
26 ms |
608 KB |
Output is correct |
55 |
Correct |
7 ms |
608 KB |
Output is correct |
56 |
Correct |
22 ms |
608 KB |
Output is correct |
57 |
Correct |
35 ms |
608 KB |
Output is correct |
58 |
Correct |
28 ms |
608 KB |
Output is correct |
59 |
Correct |
15 ms |
608 KB |
Output is correct |
60 |
Correct |
30 ms |
608 KB |
Output is correct |
61 |
Correct |
8 ms |
608 KB |
Output is correct |
62 |
Correct |
6 ms |
608 KB |
Output is correct |
63 |
Correct |
7 ms |
608 KB |
Output is correct |
64 |
Correct |
7 ms |
608 KB |
Output is correct |
65 |
Correct |
8 ms |
608 KB |
Output is correct |
66 |
Correct |
5 ms |
608 KB |
Output is correct |
67 |
Correct |
10 ms |
608 KB |
Output is correct |
68 |
Correct |
7 ms |
608 KB |
Output is correct |
69 |
Correct |
10 ms |
608 KB |
Output is correct |
70 |
Correct |
5 ms |
608 KB |
Output is correct |
71 |
Partially correct |
42 ms |
608 KB |
Partially correct - number of queries: 5229 |
72 |
Correct |
12 ms |
608 KB |
Output is correct |
73 |
Partially correct |
54 ms |
608 KB |
Partially correct - number of queries: 5166 |
74 |
Partially correct |
51 ms |
608 KB |
Partially correct - number of queries: 5193 |
75 |
Correct |
8 ms |
608 KB |
Output is correct |
76 |
Correct |
51 ms |
608 KB |
Output is correct |
77 |
Correct |
54 ms |
608 KB |
Output is correct |
78 |
Correct |
6 ms |
608 KB |
Output is correct |
79 |
Correct |
30 ms |
608 KB |
Output is correct |
80 |
Correct |
39 ms |
608 KB |
Output is correct |
81 |
Correct |
22 ms |
608 KB |
Output is correct |
82 |
Correct |
22 ms |
608 KB |
Output is correct |
83 |
Correct |
8 ms |
608 KB |
Output is correct |
84 |
Correct |
44 ms |
608 KB |
Output is correct |
85 |
Correct |
43 ms |
608 KB |
Output is correct |
86 |
Incorrect |
97 ms |
608 KB |
Incorrect |
87 |
Halted |
0 ms |
0 KB |
- |