#include<bits/stdc++.h>
using namespace std;
vector<int> ask(int i);/*{
cout << i << '\n';
vector<int> a(2);
cin >> a[0] >> a[1];
return a;
}*/
int clol, ans;
bool wegood = false;
void solve(int l, int r, int lpl, int lpr){
int m = l+r>>1;
auto a = ask(m);
if(a[0]+a[1] == 0) {
ans = m;
wegood = true;
return;
}
if(a[0]+a[1] == clol){
if(a[0] > lpl && l < m) solve(l, m-1, lpl, a[1]);
if(wegood) return;
if(a[1] > lpr && r > m) solve(m+1, r, a[0], lpr);
return;
}
int L = m-1, R = m+1;
while(R < r){
auto a = ask(R);
if(a[0]+a[1]==0){
ans = R;
wegood = true;
return;
}
if(a[0]+a[1]==clol){
if(a[1] > lpr && R < r) solve(R+1, r, a[0], lpr);
if(wegood) return;
break;
}
R++;
}
while(L > l){
auto a = ask(L);
if(a[0]+a[1]==0){
ans = L;
wegood = true;
return;
}
if(a[0]+a[1]==clol){
if(a[0] > lpl && L > l) solve(l, L-1, lpl, a[1]);
if(wegood) return;
break;
}
L--;
}
}
int find_best(int n){
pair<int, pair<int, int>> lol = {0,{0, 0}};
for(int i = 0;i < 1;i++){
auto a = ask(i);
if(a[0]+a[1] == 0) return i;
lol = max(lol, make_pair(a[0]+a[1], make_pair(a[0], i)));
}
clol = lol.first;
solve(lol.second.second+1, n-1, lol.second.first, 0);
return ans;
}/*
int main(){
int n;
cin >> n;
cout << find_best(n) << '\n';
}*/
Compilation message
prize.cpp: In function 'void solve(int, int, int, int)':
prize.cpp:12:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
12 | int m = l+r>>1;
| ~^~
| # |
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 |
296 KB |
Output is correct |
| 4 |
Correct |
1 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
292 KB |
Output is correct |
| 6 |
Correct |
1 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
292 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
1 ms |
292 KB |
Output is correct |
| 10 |
Correct |
1 ms |
208 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
292 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct |
| 4 |
Correct |
1 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
208 KB |
Output is correct |
| 6 |
Correct |
0 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
292 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
296 KB |
Output is correct |
| 10 |
Correct |
1 ms |
208 KB |
Output is correct |
| 11 |
Correct |
2 ms |
208 KB |
Output is correct |
| 12 |
Correct |
1 ms |
208 KB |
Output is correct |
| 13 |
Correct |
2 ms |
292 KB |
Output is correct |
| 14 |
Correct |
2 ms |
208 KB |
Output is correct |
| 15 |
Correct |
6 ms |
288 KB |
Output is correct |
| 16 |
Correct |
13 ms |
288 KB |
Output is correct |
| 17 |
Correct |
1 ms |
208 KB |
Output is correct |
| 18 |
Correct |
15 ms |
336 KB |
Output is correct |
| 19 |
Correct |
1 ms |
208 KB |
Output is correct |
| 20 |
Correct |
10 ms |
288 KB |
Output is correct |
| 21 |
Correct |
10 ms |
296 KB |
Output is correct |
| 22 |
Correct |
3 ms |
292 KB |
Output is correct |
| 23 |
Correct |
0 ms |
288 KB |
Output is correct |
| 24 |
Correct |
1 ms |
292 KB |
Output is correct |
| 25 |
Correct |
16 ms |
292 KB |
Output is correct |
| 26 |
Correct |
24 ms |
208 KB |
Output is correct |
| 27 |
Correct |
1 ms |
208 KB |
Output is correct |
| 28 |
Correct |
28 ms |
208 KB |
Output is correct |
| 29 |
Correct |
19 ms |
296 KB |
Output is correct |
| 30 |
Correct |
21 ms |
208 KB |
Output is correct |
| 31 |
Correct |
1 ms |
288 KB |
Output is correct |
| 32 |
Correct |
2 ms |
292 KB |
Output is correct |
| 33 |
Correct |
0 ms |
208 KB |
Output is correct |
| 34 |
Correct |
5 ms |
296 KB |
Output is correct |
| 35 |
Correct |
1 ms |
292 KB |
Output is correct |
| 36 |
Correct |
9 ms |
288 KB |
Output is correct |
| 37 |
Correct |
1 ms |
328 KB |
Output is correct |
| 38 |
Correct |
1 ms |
292 KB |
Output is correct |
| 39 |
Correct |
7 ms |
336 KB |
Output is correct |
| 40 |
Correct |
24 ms |
208 KB |
Output is correct |
| 41 |
Correct |
13 ms |
292 KB |
Output is correct |
| 42 |
Correct |
9 ms |
296 KB |
Output is correct |
| 43 |
Correct |
14 ms |
208 KB |
Output is correct |
| 44 |
Correct |
6 ms |
336 KB |
Output is correct |
| 45 |
Correct |
5 ms |
336 KB |
Output is correct |
| 46 |
Correct |
1 ms |
288 KB |
Output is correct |
| 47 |
Correct |
16 ms |
328 KB |
Output is correct |
| 48 |
Correct |
20 ms |
208 KB |
Output is correct |
| 49 |
Correct |
1 ms |
208 KB |
Output is correct |
| 50 |
Correct |
15 ms |
292 KB |
Output is correct |
| 51 |
Correct |
12 ms |
292 KB |
Output is correct |
| 52 |
Correct |
1 ms |
208 KB |
Output is correct |
| 53 |
Correct |
1 ms |
292 KB |
Output is correct |
| 54 |
Correct |
6 ms |
288 KB |
Output is correct |
| 55 |
Correct |
1 ms |
208 KB |
Output is correct |
| 56 |
Correct |
15 ms |
336 KB |
Output is correct |
| 57 |
Correct |
26 ms |
208 KB |
Output is correct |
| 58 |
Correct |
11 ms |
296 KB |
Output is correct |
| 59 |
Correct |
16 ms |
336 KB |
Output is correct |
| 60 |
Correct |
20 ms |
208 KB |
Output is correct |
| 61 |
Correct |
2 ms |
288 KB |
Output is correct |
| 62 |
Correct |
0 ms |
288 KB |
Output is correct |
| 63 |
Correct |
1 ms |
208 KB |
Output is correct |
| 64 |
Correct |
1 ms |
336 KB |
Output is correct |
| 65 |
Incorrect |
39 ms |
292 KB |
Incorrect |
| 66 |
Halted |
0 ms |
0 KB |
- |
