Submission #1060876

#TimeUsernameProblemLanguageResultExecution timeMemory
1060876onbertThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms428 KiB
#include "prize.h" #include <bits/stdc++.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> val = ask(mid); if (val[0] + val[1]==0) return mid; if (val[0] == 1) r = mid-1; else l = mid+1; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...