oj.uz

Submission #198286

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

Subtask #1
0 / 37.0

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

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 248 KB not a binary tree
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

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