# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251398 | nafis_shifat | The Big Prize (IOI17_prize) | C++14 | 72 ms | 364 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 "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
int ind=0;
int pos=0;
for(int i=0;i<n;i=pos+1) {
vector<int> r=ask(i);
if(r[0]+r[1]==0)return i;
int lo=i+1;
int hi=n-1;
while(lo<=hi) {
int mid=lo+hi>>1;
vector<int> tmp=ask(mid);
if(tmp[0]+tmp[1]==0)return mid;
if(tmp[0]> r[0] || (tmp[0]==r[0] && r[1]>tmp[1])) {
pos=mid;
hi=mid-1;
}else {
lo=mid+1;
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |