| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1329428 | ezzzay | The Big Prize (IOI17_prize) | C++20 | 0 ms | 416 KiB |
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
int lo=0,hi=n-1;
while(hi>=lo){
int mid=(hi+lo)/2;
std::vector<int> res = ask(mid);
if(res[0]==1){
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... | ||||
