#include "prize.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll l,r,c,ma;
vector<int> v;
int find_best(int n) {
for(int i = 0; i < n; i++) {
std::vector<int> res = ask(i);
if(res[0] + res[1] == 0)
return i;
ma=max((ll)ma,(ll)(res[0]+res[1]));
if(res[0]+res[1]!=ma)
continue;
l=i+1;
r=n-1;
while(l<=r)
{
c=(l+r)/2;
v=ask(c);
if(v[0]+v[1]!=res[0]+res[1]&&res[0]+1==v[0])
{
i=c;
l=c+1;
}
else
if(v[0]==res[0]&&v[1]==res[1])
{
i=c;
l=c+1;
}
else
r=c-1;
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2016 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 11 |
Correct |
3 ms |
2016 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 13 |
Correct |
6 ms |
2016 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 16 |
Partially correct |
89 ms |
2016 KB |
Partially correct - number of queries: 7333 |
| 17 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 18 |
Partially correct |
29 ms |
2016 KB |
Partially correct - number of queries: 8609 |
| 19 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 20 |
Correct |
3 ms |
2016 KB |
Output is correct |
| 21 |
Correct |
19 ms |
2016 KB |
Output is correct |
| 22 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 23 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 24 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 25 |
Correct |
16 ms |
2016 KB |
Output is correct |
| 26 |
Correct |
23 ms |
2016 KB |
Output is correct |
| 27 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 28 |
Partially correct |
53 ms |
2016 KB |
Partially correct - number of queries: 8167 |
| 29 |
Partially correct |
33 ms |
2016 KB |
Partially correct - number of queries: 6207 |
| 30 |
Partially correct |
39 ms |
2016 KB |
Partially correct - number of queries: 8552 |
| 31 |
Correct |
0 ms |
2016 KB |
Output is correct |
| 32 |
Correct |
3 ms |
2016 KB |
Output is correct |
| 33 |
Incorrect |
3 ms |
2016 KB |
answer is not correct |
| 34 |
Halted |
0 ms |
0 KB |
- |
