#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
int mx = 0, lim = 500;
for (int i = 0; i < min(n, lim); i ++) {
vector<int> a = ask(i);
mx = max(mx, a[0] + a[1]);
if (a[0] + a[1] == 0) return i;
}
for (int i = 0; i < n; i ++) {
vector<int> a = ask(i);
int logg = 600;
if (a[0] + a[1] == mx) {
for (int j = logg; j >= 1; j /= 2) {
if (i + j >= n) continue;
vector<int> b = ask(i + j);
if (a[1] == b[1]) i += j;
}
}
else if (a[0] + a[1] == 0) return i;
}
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
25 | }
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
344 KB |
Output is correct |
2 |
Correct |
5 ms |
344 KB |
Output is correct |
3 |
Correct |
7 ms |
344 KB |
Output is correct |
4 |
Correct |
14 ms |
344 KB |
Output is correct |
5 |
Correct |
8 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
6 ms |
344 KB |
Output is correct |
8 |
Correct |
7 ms |
344 KB |
Output is correct |
9 |
Correct |
5 ms |
344 KB |
Output is correct |
10 |
Correct |
14 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
344 KB |
Output is correct |
2 |
Correct |
10 ms |
344 KB |
Output is correct |
3 |
Correct |
9 ms |
344 KB |
Output is correct |
4 |
Correct |
8 ms |
344 KB |
Output is correct |
5 |
Correct |
8 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
4 ms |
344 KB |
Output is correct |
8 |
Correct |
8 ms |
344 KB |
Output is correct |
9 |
Correct |
8 ms |
344 KB |
Output is correct |
10 |
Correct |
11 ms |
344 KB |
Output is correct |
11 |
Correct |
12 ms |
344 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
10 ms |
344 KB |
Output is correct |
14 |
Correct |
5 ms |
344 KB |
Output is correct |
15 |
Correct |
8 ms |
432 KB |
Output is correct |
16 |
Partially correct |
41 ms |
424 KB |
Partially correct - number of queries: 7601 |
17 |
Correct |
4 ms |
424 KB |
Output is correct |
18 |
Partially correct |
47 ms |
344 KB |
Partially correct - number of queries: 8958 |
19 |
Correct |
3 ms |
424 KB |
Output is correct |
20 |
Correct |
8 ms |
424 KB |
Output is correct |
21 |
Correct |
13 ms |
344 KB |
Output is correct |
22 |
Correct |
5 ms |
344 KB |
Output is correct |
23 |
Correct |
5 ms |
344 KB |
Output is correct |
24 |
Correct |
3 ms |
344 KB |
Output is correct |
25 |
Correct |
31 ms |
344 KB |
Output is correct |
26 |
Correct |
24 ms |
344 KB |
Output is correct |
27 |
Correct |
5 ms |
344 KB |
Output is correct |
28 |
Partially correct |
33 ms |
344 KB |
Partially correct - number of queries: 6688 |
29 |
Partially correct |
32 ms |
344 KB |
Partially correct - number of queries: 5288 |
30 |
Partially correct |
38 ms |
344 KB |
Partially correct - number of queries: 6148 |
31 |
Correct |
2 ms |
344 KB |
Output is correct |
32 |
Correct |
14 ms |
424 KB |
Output is correct |
33 |
Correct |
1 ms |
344 KB |
Output is correct |
34 |
Correct |
11 ms |
344 KB |
Output is correct |
35 |
Correct |
8 ms |
424 KB |
Output is correct |
36 |
Correct |
11 ms |
344 KB |
Output is correct |
37 |
Correct |
4 ms |
344 KB |
Output is correct |
38 |
Correct |
4 ms |
344 KB |
Output is correct |
39 |
Correct |
13 ms |
344 KB |
Output is correct |
40 |
Partially correct |
27 ms |
344 KB |
Partially correct - number of queries: 5310 |
41 |
Correct |
22 ms |
344 KB |
Output is correct |
42 |
Correct |
17 ms |
424 KB |
Output is correct |
43 |
Correct |
18 ms |
424 KB |
Output is correct |
44 |
Correct |
19 ms |
348 KB |
Output is correct |
45 |
Correct |
14 ms |
344 KB |
Output is correct |
46 |
Correct |
3 ms |
428 KB |
Output is correct |
47 |
Correct |
15 ms |
344 KB |
Output is correct |
48 |
Partially correct |
38 ms |
344 KB |
Partially correct - number of queries: 6842 |
49 |
Correct |
5 ms |
344 KB |
Output is correct |
50 |
Partially correct |
44 ms |
344 KB |
Partially correct - number of queries: 8672 |
51 |
Correct |
18 ms |
344 KB |
Output is correct |
52 |
Correct |
3 ms |
344 KB |
Output is correct |
53 |
Correct |
12 ms |
344 KB |
Output is correct |
54 |
Correct |
15 ms |
344 KB |
Output is correct |
55 |
Correct |
3 ms |
424 KB |
Output is correct |
56 |
Partially correct |
52 ms |
428 KB |
Partially correct - number of queries: 8914 |
57 |
Partially correct |
26 ms |
344 KB |
Partially correct - number of queries: 5033 |
58 |
Partially correct |
27 ms |
344 KB |
Partially correct - number of queries: 5072 |
59 |
Correct |
19 ms |
344 KB |
Output is correct |
60 |
Correct |
20 ms |
344 KB |
Output is correct |
61 |
Correct |
13 ms |
344 KB |
Output is correct |
62 |
Correct |
5 ms |
344 KB |
Output is correct |
63 |
Correct |
10 ms |
344 KB |
Output is correct |
64 |
Correct |
10 ms |
344 KB |
Output is correct |
65 |
Correct |
15 ms |
344 KB |
Output is correct |
66 |
Correct |
15 ms |
344 KB |
Output is correct |
67 |
Correct |
13 ms |
344 KB |
Output is correct |
68 |
Correct |
3 ms |
344 KB |
Output is correct |
69 |
Correct |
19 ms |
344 KB |
Output is correct |
70 |
Correct |
10 ms |
344 KB |
Output is correct |
71 |
Incorrect |
61 ms |
344 KB |
Incorrect |
72 |
Halted |
0 ms |
0 KB |
- |