Submission #1138016

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

popa

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

stack<int> st;

int solve(int N, int* Left, int* Right) {
    int root = -1;

    for (int i = 0; i < N; i++)
        Left[i] = Right[i] = -1;

    for (int i = 0; i < N; i++) {
        while (st.size() && query(st.top(), i, i, i)) {
            Right[st.top()] = -1;
            Left[i] = st.top();
            st.pop();
        }

        if (st.empty()) root = i;
            else Right[st.top()] = i;
        st.push(i);
    }

    return root;
}

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