Submission #797386

#TimeUsernameProblemLanguageResultExecution timeMemory
797386WongChun1234The Big Prize (IOI17_prize)C++14
20 / 100
1 ms336 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; int l,r,mid; int find_best(int n) { l=0,r=n-1; while (l<r){ mid=(l+r)/2; vector<int> res=ask(mid); if (res[0]) r=mid-1; else if (res[1]) l=mid+1; else return mid; } return max(0,min(l,n-1)); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...