제출 #1199513

#제출 시각아이디문제언어결과실행 시간메모리
1199513AvianshThe 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 lo = 0; int hi = n-1; while(lo<hi){ int mid = (lo+hi)/2; vector<int>res = ask(mid); if(res[0]==1){ hi=mid-1; } else if(res[1]==1){ lo=mid+1; } else{ lo=mid; return mid; } } return lo; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...