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>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
vector<vector<int>> asked;
vector<int> Ask(int i){
if(asked[i].empty()) asked[i] = ask(i);
return asked[i];
}
int find_best(int n){
int p = 0;
while(1){
auto cur = ask(p);
if(cur[0]+cur[1] == 0) return p;
int a = p+1, b = n-1;
while(a < b){
int md = (a+b)/2;
auto v = ask(md);
if(v[0]+v[1] != cur[0]+cur[1]) b = md;
else if(v[0] != v[1]) b = md-1;
else a = md+1;
}
p = a;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |