oj.uz

Submission #198299

# Submission time Handle Problem Language Result Execution time Memory
198299 2020-01-25T12:45:55 Z forelax popa (BOI18_popa) C++14
0 / 100
 24 ms 400 KB 
#include<bits/stdc++.h>
#include "popa.h"
using namespace std;
int solve(int n,int* lf,int* rg){
	int cr[n];
	int pt=0;
	for(int i = 0 ; i < n ; i ++){
		lf[i]=-1;rg[i]=-1;
		while(pt&&!query(cr[pt-1],cr[pt-1],cr[pt-1],i)){
			lf[i]=cr[pt-1];
			pt--;
		}
		if(pt){
			rg[pt-1]=i;
		}
		cr[pt++]=i;
	}
	return cr[0];
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 400 KB not a valid binary tree
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 324 KB not a valid binary tree
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 376 KB not a valid binary tree
2 Halted 0 ms 0 KB -