| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 103363 | daniel920712 | The Big Prize (IOI17_prize) | C++14 | 4 ms | 1792 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 <iostream>
#include <stdio.h>
#include <math.h>
#include <assert.h>
#include "prize.h"
using namespace std;
int all[200005];
int l[200005],r[200005];
int F(int L,int R)
{
//printf("%d %d\n",L,R);
vector < int > t;
int x;
if(l[(L+R)/2]==-1)
{
t=ask((L+R)/2);
l[(L+R)/2]=t[0];
r[(L+R)/2]=t[1];
}
if(L==R)
{
if(l[L]||r[L]) return -1;
return L;
}
else if(L+1==R)
{
if(l[L]||r[L]) return R;
return L;
}
else
{
if(l[R]==l[(L+R)/2]) return F(L,(L+R)/2+1);
else if(r[L]==r[(L+R)/2]) return F((L+R)/2,R);
else
{
x=F((L+R)/2+1,R);
if(x!=-1) return x;
return F(L,(L+R)/2);
}
}
}
int find_best(int n)
{
vector < int > t;
int i,j,all=0;
for(i=0;i<n;i++) l[i]=r[i]=-1;
t=ask(0);
l[0]=t[0];
r[0]=t[1];
t=ask(n-1);
l[n-1]=t[0];
r[n-1]=t[1];
return F(0,n-1);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
