#include "prize.h"
#include <bits/stdc++.h>
typedef long long ll;
#define all(v) v.begin(), v.end()
#define FOR(i, n) for (int i = 0; i < n; i++)
using namespace std;
int find_best(int n) {
int mn = 0;
FOR(i, min(600, n)){
auto res = ask(i);
mn = max(mn, res[0] + res[1]);
}
vector<int> pos;
int l = 0, r = 1;
FOR(i, mn){
while(1){
auto ret = ask(r);
if(ret[0] + ret[1] != mn) break;
if(ret[0] > i) break;
r += (r - l);
if(r >= n){
r = n - 1;
break;
}
}
while(l < r){
int mid = (l + r) / 2;
auto ret = ask(mid);
if(ret[0] + ret[1] != mn) r = mid;
else if(ret[0] > i) r = mid - 1;
else l = mid + 1;
}
pos.push_back(l);
if(r != n - 1) r++;
}
for (auto i : pos) {
auto ret = ask(i);
if(ret[0] + ret[1] == 0) return i;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
344 KB |
Output is correct |
| 2 |
Correct |
3 ms |
344 KB |
Output is correct |
| 3 |
Correct |
4 ms |
344 KB |
Output is correct |
| 4 |
Correct |
4 ms |
344 KB |
Output is correct |
| 5 |
Correct |
3 ms |
344 KB |
Output is correct |
| 6 |
Correct |
3 ms |
344 KB |
Output is correct |
| 7 |
Correct |
3 ms |
344 KB |
Output is correct |
| 8 |
Correct |
3 ms |
340 KB |
Output is correct |
| 9 |
Correct |
4 ms |
344 KB |
Output is correct |
| 10 |
Correct |
4 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
344 KB |
Output is correct |
| 2 |
Correct |
3 ms |
344 KB |
Output is correct |
| 3 |
Correct |
2 ms |
344 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
4 ms |
344 KB |
Output is correct |
| 6 |
Correct |
2 ms |
344 KB |
Output is correct |
| 7 |
Correct |
2 ms |
344 KB |
Output is correct |
| 8 |
Correct |
3 ms |
344 KB |
Output is correct |
| 9 |
Correct |
3 ms |
344 KB |
Output is correct |
| 10 |
Correct |
3 ms |
344 KB |
Output is correct |
| 11 |
Correct |
6 ms |
344 KB |
Output is correct |
| 12 |
Correct |
7 ms |
344 KB |
Output is correct |
| 13 |
Correct |
7 ms |
344 KB |
Output is correct |
| 14 |
Correct |
17 ms |
436 KB |
Output is correct |
| 15 |
Partially correct |
37 ms |
444 KB |
Partially correct - number of queries: 9068 |
| 16 |
Partially correct |
48 ms |
424 KB |
Partially correct - number of queries: 9772 |
| 17 |
Partially correct |
39 ms |
416 KB |
Partially correct - number of queries: 9385 |
| 18 |
Partially correct |
43 ms |
408 KB |
Partially correct - number of queries: 9864 |
| 19 |
Partially correct |
38 ms |
432 KB |
Partially correct - number of queries: 8643 |
| 20 |
Partially correct |
37 ms |
428 KB |
Partially correct - number of queries: 6651 |
| 21 |
Partially correct |
53 ms |
432 KB |
Partially correct - number of queries: 9449 |
| 22 |
Partially correct |
36 ms |
412 KB |
Partially correct - number of queries: 7743 |
| 23 |
Correct |
3 ms |
340 KB |
Output is correct |
| 24 |
Correct |
6 ms |
340 KB |
Output is correct |
| 25 |
Incorrect |
25 ms |
428 KB |
answer is not correct |
| 26 |
Halted |
0 ms |
0 KB |
- |
