Submission #548880

#TimeUsernameProblemLanguageResultExecution timeMemory
548880esomerThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms296 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; int find_best(int n) { int lo = 0; int hi = n - 1; while(lo <= hi){ int mid = (lo + hi) / 2; vector<int> rep = ask(mid); if(rep[0] == 1){ hi = mid - 1; }else if(rep[1] == 1){ lo = mid + 1; }else{ return mid; } } return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...