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