#include "prize.h"
#include<bits/stdc++.h>
#define F first
#define S second
using namespace std;
pair<int,int>p,p1;
vector<int>v,v1;
int ans=0;
void go(int L,int R)
{
if(L>R)return;
if(L==R)
{
v=ask(L);
if(v[0]+v[1]==0)
{
ans=L;
return;
}
}
else
{
v=ask(L);
if(v[0]+v[1]==0)
{
ans=L;
return;
}
v1=ask(R);
if(v1[0]+v1[1]==0)
{
ans=R;
return;
}
if(v[0]==v1[0] || v[1]==v1[1])return;
int mid=(L+R)/2;
go(L+1,mid);
go(mid+1,R-1);
}
}
int find_best(int n) {
go(0,n-1);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
420 KB |
Output is correct |
2 |
Correct |
2 ms |
420 KB |
Output is correct |
3 |
Correct |
2 ms |
420 KB |
Output is correct |
4 |
Correct |
2 ms |
420 KB |
Output is correct |
5 |
Correct |
2 ms |
420 KB |
Output is correct |
6 |
Correct |
2 ms |
420 KB |
Output is correct |
7 |
Correct |
2 ms |
612 KB |
Output is correct |
8 |
Correct |
2 ms |
612 KB |
Output is correct |
9 |
Correct |
2 ms |
612 KB |
Output is correct |
10 |
Correct |
2 ms |
612 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
612 KB |
Output is correct |
2 |
Correct |
2 ms |
612 KB |
Output is correct |
3 |
Correct |
2 ms |
612 KB |
Output is correct |
4 |
Correct |
2 ms |
612 KB |
Output is correct |
5 |
Correct |
2 ms |
612 KB |
Output is correct |
6 |
Correct |
2 ms |
612 KB |
Output is correct |
7 |
Correct |
2 ms |
612 KB |
Output is correct |
8 |
Correct |
2 ms |
612 KB |
Output is correct |
9 |
Correct |
2 ms |
612 KB |
Output is correct |
10 |
Correct |
2 ms |
612 KB |
Output is correct |
11 |
Correct |
9 ms |
612 KB |
Output is correct |
12 |
Correct |
8 ms |
612 KB |
Output is correct |
13 |
Correct |
13 ms |
612 KB |
Output is correct |
14 |
Correct |
19 ms |
612 KB |
Output is correct |
15 |
Incorrect |
93 ms |
612 KB |
Incorrect |
16 |
Halted |
0 ms |
0 KB |
- |