제출 #556231

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