| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 470648 | Carmel_Ab1 | The Big Prize (IOI17_prize) | C++17 | 81 ms | 328 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=0; i<n; i+=sz){
vi s=(prv[0]==-1?ask(i):prv),e=ask(min(n-1,i+sz));
if(s[0]==0 && s[1]==0)
return i;
if(e[0]==0 && e[1]==0)
return min(i+sz,n-1);
if(e[0]==s[0] || s[1]==e[1])
continue;
for(int j=i+1; j<min(n-1,i+sz); j++) {
vi v=ask(j);
if(v[0]==0 && v[1]==0)
return j;
}
prv=e;
}
assert(0);
return -1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
