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;
typedef long long ll;
const int maxn = 2e5+50;
int l,r,dp[maxn],ans;
void qu(int a){
if(dp[a])return;
dp[a] = 1;
vector<int> res = ask(a);
if(res[0] + res[1] == 1){
if(res[0])r = a-1;
else l = a+1;
}
if(res[0] + res[1] == 0){
ans = a;
}
}
int find_best(int n) {
srand(time(0));
l=0;r=n-1;
ans = -1;
while(1){
int a = l + (rand() % (r-l+1));
qu(a);
if(ans != -1)return ans;
}
int a = l + (rand() % (r-l+1));
return a;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |