#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n) {
int cur = 0;
while (true) {
vector<int> res1 = ask(cur);
if (res1[0] + res1[1] == 0) {
return cur;
}
int lt = cur + 1;
int rt = n - 2;
while (lt <= rt) {
int mt = (lt + rt) / 2;
vector<int> res2 = ask(mt);
if (res2[0] + res2[1] == 0) {
return mt;
}
if (res2[1] == res1[1]) {
cur = mt;
lt = mt + 1;
}
else {
rt = mt - 1;
}
}
cur++;
}
return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
296 KB |
Output is correct |
3 |
Correct |
1 ms |
288 KB |
Output is correct |
4 |
Correct |
0 ms |
292 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
1 ms |
208 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
8 |
Correct |
0 ms |
288 KB |
Output is correct |
9 |
Correct |
0 ms |
208 KB |
Output is correct |
10 |
Correct |
0 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
292 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
292 KB |
Output is correct |
5 |
Correct |
1 ms |
292 KB |
Output is correct |
6 |
Correct |
1 ms |
288 KB |
Output is correct |
7 |
Correct |
0 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
288 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
10 |
Correct |
1 ms |
208 KB |
Output is correct |
11 |
Correct |
5 ms |
292 KB |
Output is correct |
12 |
Correct |
1 ms |
288 KB |
Output is correct |
13 |
Correct |
7 ms |
288 KB |
Output is correct |
14 |
Correct |
3 ms |
208 KB |
Output is correct |
15 |
Correct |
16 ms |
292 KB |
Output is correct |
16 |
Incorrect |
67 ms |
208 KB |
Incorrect |
17 |
Halted |
0 ms |
0 KB |
- |