Submission #1138022

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138022		ConquerConquerer	popa (BOI18_popa)	C++20	100 / 100	25 ms	424 KiB

popa

#include <bits/stdc++.h>
#include "popa.h"
using namespace std;

int st[1005];

int solve(int N, int* L, int* R) {
    int root = -1;

    for (int i = 0; i < N; i++)
        L[i] = R[i] = -1;
    int idx = 0;

    for (int i = 0; i < N; i++) {
        while (idx && query(st[idx], i, i, i)) {
            R[st[idx]] = L[i];
            L[i] = st[idx];
            idx--;
        }

        if (!idx) root = i;
            else R[st[idx]] = i;
        st[++idx] = i;
    }

    return root;
}

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