Submission #59772

#	Time	Username	Problem	Language	Result	Execution time	Memory
59772		model_code	popa (BOI18_popa)	C++17	61 / 100	192 ms	664 KiB

popa

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

using namespace std;

const int MaxN = 10010;

int lf[MaxN], rg[MaxN];

int dfs(int l, int r) {
	if (l > r) return -1;
	int a = l, b = r;
	while (1) {
		if (query(l, r, a, a)) {
			lf[a] = dfs(l, a - 1);
			rg[a] = dfs(a + 1, r);
			return a;
		}
		if (query(l, r, b, b)) {
			lf[b] = dfs(l, b - 1);
			rg[b] = dfs(b + 1, r);
			return b;
		}
		a++;
		b--;
	}
}

int solve(int n, int* left, int* right) {
	int root = dfs(0, n - 1);
	for (int i = 0; i < n; i++) {
		left[i] = lf[i];
		right[i] = rg[i];
	}
	return root;
}

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