# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
470636 | Carmel_Ab1 | The Big Prize (IOI17_prize) | C++17 | 0 ms | 0 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;
typedef vector<int>vi;
#include "grader.cpp"
int find_best(int n) {
int sz=450;
vi prv={-1,-1};
for(int i=1; i<=n; i+=sz){
vi s=(prv[0]!=-1?ask(i):prv),e=ask(min(n,i+sz));
if(s[0]==e[0])
continue;
for(int j=i; j<=min(n,i+sz); j++) {
vi v=ask(i);
if(v[0]==0 && v[1]==0)
return i;
}
prv=e;
}
assert(0);
return -1;
}