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 "popa.h"
int solve(int N, int* Left, int* Right)
{
/*int n=N;
int t[1010];
for(int i=0;i<n;++i)
{
t[i]=0;
Left[i]=Right[i]=-1;
}
for(int i=0;i+1<n;++i)
{
if(query(i,i,i,i+1)==true)
{
t[i+1]=i;
Right[i]=i+1;
}
else
{
int x=i;
while(t[x])
x=t[x];
t[x]=i+1;
Left[i+1]=x;
}
}
for(int i=0;i<n;++i)
if(t[i]==0)
return i;*/
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |