# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296900 | Dovran | The Big Prize (IOI17_prize) | C++11 | 0 ms | 256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "prize.h"
#define N 300009
#define pii pair <int, int>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;
int find_best(int n){
int l=0, r=n-1;
int ans;
while(l>=r){
int md=(l+r)/2;
vector<int>e=ask(md);
if(e[0]+e[1]>1){
ans=3;
break;
}
if(!e[0] and !e[1]){
ans=md;
break;
}
if(e[0]>0)
r=md-1;
else
l=md+1;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |