# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1199513 | Aviansh | 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 lo = 0;
int hi = n-1;
while(lo<hi){
int mid = (lo+hi)/2;
vector<int>res = ask(mid);
if(res[0]==1){
hi=mid-1;
}
else if(res[1]==1){
lo=mid+1;
}
else{
lo=mid;
return mid;
}
}
return lo;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |