Submission #1174828

#TimeUsernameProblemLanguageResultExecution timeMemory
1174828ThylOneThe Big Prize (IOI17_prize)C++20
20 / 100
0 ms408 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int n) { int low = 0; int high = n; while(low<high){ int mid = (low+high)/2; auto re = ask(mid); if(re[1]==0 && re[0]==0){ return mid; } if(re[1]){ low = mid + 1; }else{ high = mid; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...