# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1188985 | Mamikonm1 | The Big Prize (IOI17_prize) | C++20 | 23 ms | 408 KiB |
#include <bits//stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n) {
int l = 0, r = n, md, ans = -1;
while (1) {
md = r + l >> 1;
vector<int>cur = ask(md);
if (cur[0])
r = md;
else if (cur[1])
l = md;
else {
ans = md;
break;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |