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 "popa.h"
#include <stdio.h>
const int N=1050;
int S[N],c;
int solve(int n, int* l, int* r)
{
int i;
int root=-1;c=0;
for(i=0;i<n;i++)
{
l[i]=r[i]=-1;
while(c && query(S[c],i,i,i))
{
r[S[c]]=l[i];
l[i]=S[c];
c--;
}
if(!c) root=i;
else r[S[c]]=i;
S[++c]=i;
}
return root;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |