Submission #122797

#	Time	Username	Problem	Language	Result	Execution time	Memory
122797		stefdasca	popa (BOI18_popa)	C++14	100 / 100	111 ms	376 KiB

popa

#include <bits/stdc++.h>
#include "popa.h"

int parent[1005];
int solve(int n, int *left, int *right)
{
	for(int i = 0; i < n; i++)
    {
		left[i] = -1;
		right[i] = -1;
		parent[i] = -1;
	}
	int root = -1;
	for(int i = 0; i < n; i++)
	{
		int curr = i - 1;
		while(curr != -1 && query(i, i, curr, i))
		{
			right[curr] = left[i];
			parent[left[i]] = curr;
			left[i] = curr;
			int nxt = parent[curr];
			parent[curr] = i;
			curr = nxt;
		}
		if(curr == -1)
        {
			left[i] = root;
			if(root != -1)
				parent[root] = i;
			root = i;
		}
		else
        {
			right[curr] = i;
			parent[i] = curr;
		}
	}
	return root;
}

• Subtask 1: 37 / 37
• Subtask 2: 24 / 24
• Subtask 3: 39 / 39