# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174828 | ThylOne | The Big Prize (IOI17_prize) | C++20 | 0 ms | 408 KiB |
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n) {
int low = 0;
int high = n;
while(low<high){
int mid = (low+high)/2;
auto re = ask(mid);
if(re[1]==0 && re[0]==0){
return mid;
}
if(re[1]){
low = mid + 1;
}else{
high = mid;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |