Submission #104480

#TimeUsernameProblemLanguageResultExecution timeMemory
104480dupreez커다란 상품 (IOI17_prize)C++14
20 / 100
3 ms504 KiB
#include "prize.h" using namespace std; int find_best(int n) { int lb = 0, rb = n; while (rb - lb > 1) { int md = (lb + rb) / 2; vector<int> a; a = ask(md); if (a[0] + a[1] == 0)return md; if (a[0]>0)rb = md; else lb = md; } return lb; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...