Submission #423705

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