This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
template<typename T>
int len(T &a){
return a.size();
}
int _q = 0;
int find_best(int n) {
if(n <= 5000){
for(int i = 0; i < n; i ++){
if(ask(i) == vector<int>{0, 0}){
return i;
}
}
}
int j = 0;
int rig = 0;
_q = 0;
while(true){
auto v = ask(j);
_q ++;
if(v[0] + v[1] == 0){
return j;
}
if(n - v[0] - v[1] >= n / 2){
rig = v[1];
break;
}
j ++;
}
while(true){
int l = j, r = n;
while(r - l > 1){
int m = (l + r) / 2;
vector<int> v = ask(m);
if(v[0] + v[1] == 0){
return m;
}
if(v[1] == rig){
l = m;
}else r = m;
}
j = r + 1;
rig --;
rig = max(rig, 0);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |