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;
map<int, vector<int>> ans;
vector<int> ask_res(int i){
if (ans.count(i)) return ans[i];
ans[i] = ask(i);
//if (i != 7) cout << "query " << i << " " << rep[0] << " " << rep[1] << endl;
return ans[i];
}
int find_best(int n) {
int deb = 0, fin = n - 1;
while (deb < fin){
int mid = (deb + fin)/2;
vector<int> resMid = ask_res(mid);
if (resMid[0] + resMid[1] == 0)
return mid;
if (resMid[0] != 0)
fin = mid - 1;
else
deb = mid + 1;
}
return deb;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |