# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1241627 | SpyrosAliv | The Big Prize (IOI17_prize) | C++20 | 0 ms | 404 KiB |
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n) {
int fin = -1;
int lo = 0, hi = n-1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
vector<int> ret = ask(mid);
if (ret[0] == 0 && ret[1] == 0) {
fin = mid;
break;
}
int toL = mid;
if (ret[0] == toL) lo = mid+1;
else hi = mid-1;
}
return fin;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |