Submission #1138018

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

popa

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

stack<int> st;

int solve(int N, int* L, int* R) {
    while (st.size() > 0) st.pop();
    
    int root = -1;

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

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

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

    return root;
}

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