#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n) {
int mx = 0;
for (int i = 0; i < n; ++i) {
vector<int> res = ask(i);
if (res[0] + res[1] == 0) {
return i;
}
if (res[0] + res[1] < mx) {
++i;
continue;
}
mx = max(mx, res[0] + res[1]);
int l = i, r = n - 1;
while (l < r) {
int mid = (l + r + 1) >> 1;
vector<int> res2 = ask(mid);
if (res2[1] < res[1]) {//I skipped a more valuable person
r = mid - 1;
} else {
l = mid;
}
}
i = l;
}
assert(false);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
436 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
2 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
5 ms |
344 KB |
Output is correct |
14 |
Correct |
2 ms |
344 KB |
Output is correct |
15 |
Correct |
6 ms |
344 KB |
Output is correct |
16 |
Partially correct |
36 ms |
344 KB |
Partially correct - number of queries: 7328 |
17 |
Correct |
1 ms |
344 KB |
Output is correct |
18 |
Partially correct |
47 ms |
344 KB |
Partially correct - number of queries: 8610 |
19 |
Correct |
0 ms |
344 KB |
Output is correct |
20 |
Correct |
14 ms |
344 KB |
Output is correct |
21 |
Correct |
13 ms |
344 KB |
Output is correct |
22 |
Correct |
3 ms |
344 KB |
Output is correct |
23 |
Correct |
0 ms |
344 KB |
Output is correct |
24 |
Correct |
0 ms |
344 KB |
Output is correct |
25 |
Correct |
23 ms |
344 KB |
Output is correct |
26 |
Correct |
25 ms |
344 KB |
Output is correct |
27 |
Correct |
1 ms |
344 KB |
Output is correct |
28 |
Partially correct |
52 ms |
344 KB |
Partially correct - number of queries: 8160 |
29 |
Partially correct |
36 ms |
344 KB |
Partially correct - number of queries: 6198 |
30 |
Partially correct |
44 ms |
344 KB |
Partially correct - number of queries: 8555 |
31 |
Correct |
1 ms |
344 KB |
Output is correct |
32 |
Correct |
3 ms |
428 KB |
Output is correct |
33 |
Correct |
1 ms |
344 KB |
Output is correct |
34 |
Correct |
17 ms |
344 KB |
Output is correct |
35 |
Correct |
2 ms |
344 KB |
Output is correct |
36 |
Correct |
13 ms |
344 KB |
Output is correct |
37 |
Correct |
1 ms |
344 KB |
Output is correct |
38 |
Correct |
0 ms |
340 KB |
Output is correct |
39 |
Correct |
25 ms |
344 KB |
Output is correct |
40 |
Partially correct |
33 ms |
344 KB |
Partially correct - number of queries: 7313 |
41 |
Partially correct |
26 ms |
344 KB |
Partially correct - number of queries: 5144 |
42 |
Partially correct |
24 ms |
344 KB |
Partially correct - number of queries: 5144 |
43 |
Correct |
13 ms |
344 KB |
Output is correct |
44 |
Correct |
19 ms |
344 KB |
Output is correct |
45 |
Correct |
12 ms |
344 KB |
Output is correct |
46 |
Correct |
1 ms |
344 KB |
Output is correct |
47 |
Correct |
18 ms |
344 KB |
Output is correct |
48 |
Partially correct |
28 ms |
344 KB |
Partially correct - number of queries: 6371 |
49 |
Correct |
3 ms |
344 KB |
Output is correct |
50 |
Partially correct |
67 ms |
344 KB |
Partially correct - number of queries: 8621 |
51 |
Correct |
26 ms |
596 KB |
Output is correct |
52 |
Correct |
1 ms |
344 KB |
Output is correct |
53 |
Correct |
1 ms |
344 KB |
Output is correct |
54 |
Correct |
21 ms |
344 KB |
Output is correct |
55 |
Correct |
0 ms |
344 KB |
Output is correct |
56 |
Partially correct |
42 ms |
344 KB |
Partially correct - number of queries: 8621 |
57 |
Partially correct |
36 ms |
344 KB |
Partially correct - number of queries: 6280 |
58 |
Partially correct |
25 ms |
344 KB |
Partially correct - number of queries: 6388 |
59 |
Partially correct |
30 ms |
344 KB |
Partially correct - number of queries: 5144 |
60 |
Correct |
15 ms |
340 KB |
Output is correct |
61 |
Correct |
1 ms |
344 KB |
Output is correct |
62 |
Correct |
0 ms |
344 KB |
Output is correct |
63 |
Correct |
1 ms |
424 KB |
Output is correct |
64 |
Correct |
1 ms |
344 KB |
Output is correct |
65 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 6 |
66 |
Halted |
0 ms |
0 KB |
- |