# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1241453 | fskarica | The Big Prize (IOI17_prize) | C++20 | 23 ms | 408 KiB |
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
int find_best(int n) {
int lo = 1, hi = n;
while (true) {
int mid = (lo + hi) / 2;
vector<int> res = ask(mid);
if(res[0] + res[1] == 0) return mid;
if (res[0]) hi = mid - 1;
else lo = mid + 1;
}
return lo;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |