oj.uz

Submission #64470

# Submission time Handle Problem Language Result Execution time Memory
64470 2018-08-04T15:36:58 Z TadijaSebez popa (BOI18_popa) C++11
0 / 100
 13 ms 448 KB 
#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;
	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;
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 248 KB invalid argument
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 376 KB invalid argument
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 448 KB invalid argument
2 Halted 0 ms 0 KB -