#include <bits/stdc++.h>
using namespace std;
#include "prize.h"
const int mx=2e6+5;
int tree[mx*4],say=0;
int min_segment(int l,int r){
if(l>r){
return -1;
}
int mid=(l+r)>>1;
vector<int>a = ask(mid);
if(a[0] == 0 && a[1] == 0){
return mid;
}
if(l==r){
return -1;
}
int tmp1=min_segment(l,mid-1);
if(tmp1!=-1){
return tmp1;
}
int tmp2=min_segment(mid+1,r);
if(tmp2!=-1){
return tmp2;
}
return -1;
}
int find_best(int n) {
return max(0,min_segment(0,n-1));
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
61 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
39 ms |
300 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |