| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366017 | yc11 | The Big Prize (IOI17_prize) | C++20 | 0 ms | 412 KiB |
#include "prize.h"
#include<bits/stdc++.h>
int find_best(int n) {
int a = 0;
int b = n;
while (b>a){
int x= (b+a)/2;
std::vector<int> c = ask(x);
if (c[0]==c[1]) return x;
else if (c[0]==1) b = x-1;
else a = x+1;
}
return b;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
