Submission #282879

#TimeUsernameProblemLanguageResultExecution timeMemory
282879ErkhemkhuuThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms384 KiB
#include <bits/stdc++.h> #include <prize.h> using namespace std; #define ll int #define pb push_back #define mp make_pair #define F first #define S second const ll N = 105; ll find_best(ll n) { ll l, r, mid; l = 0; r = n; while(l + 1 < r) { mid = (l + r) / 2; vector <ll> asked = ask(mid); if(!asked[0] && !asked[1]) return mid; if(!asked[0] && asked[1]) l = mid; else r = mid; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...