Submission #1083966

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