Submission #549158

#TimeUsernameProblemLanguageResultExecution timeMemory
549158cig32커다란 상품 (IOI17_prize)C++17
20 / 100
1 ms336 KiB
#include <bits/stdc++.h> #include "prize.h" using namespace std; int find_best(int n) { int lb = 0, rb = n - 1; while(lb < rb) { int mid = (lb + rb) >> 1; vector<int> q = ask(mid); if(q[0] == 0 && q[1] == 0) return mid; if(q[0] == 0) lb = mid + 1; else rb = mid; } return lb; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...