Submission #814548

#TimeUsernameProblemLanguageResultExecution timeMemory
814548Dan4LifeThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms292 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> a = ask(mid); if(a[0]+a[1]==0) return mid; if(a[0]) r=mid-1; else l=mid+1; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...