| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366635 | Nxmkxing | The Big Prize (IOI17_prize) | C++20 | 0 ms | 412 KiB |
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n) {
int l = 0, r = n - 1;
while (l < r) {
int mid = (l + r) / 2;
vector<int> cnt = ask(mid);
if (cnt[0] > 0) r = mid - 1;
else if (cnt[1] > 0) l = mid + 1;
else return mid;
}
return l;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
