제출 #347563

#제출 시각아이디문제언어결과실행 시간메모리
347563tengiz05커다란 상품 (IOI17_prize)C++17
20 / 100
3 ms492 KiB
#include "prize.h" //~ #include "grader.cpp" #include <bits/stdc++.h> using namespace std; int find_best(int n) { // std::vector<int> res = ask(i); int l=-1, r=n; while(l+1 < r){ int mid = (l+r)/2; vector<int> tmp = ask(mid); if(tmp[0] == 0)l = mid; else r = mid; }return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...