Submission #1188985

#TimeUsernameProblemLanguageResultExecution timeMemory
1188985Mamikonm1The Big Prize (IOI17_prize)C++20
20 / 100
23 ms408 KiB
#include <bits//stdc++.h> #include "prize.h" using namespace std; int find_best(int n) { int l = 0, r = n, md, ans = -1; while (1) { md = r + l >> 1; vector<int>cur = ask(md); if (cur[0]) r = md; else if (cur[1]) l = md; else { ans = md; break; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...