Submission #1137993

#	Time	Username	Problem	Language	Result	Execution time	Memory
1137993		thangdz2k7	popa (BOI18_popa)	C++20	100 / 100	26 ms	424 KiB

popa

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

using namespace std;

const int N = 1005;

int s[N], c;

int solve(int n, int *l, int *r){
    int root = -1, c = 0;
    for (int u = 0; u < n; ++ u){
        l[u] = r[u] = -1;
        while (c && query(s[c], u, u, u)){
            r[s[c]] = l[u];
            l[u] = s[c];
            c --;
        }
        if (!c) root = u;
        else r[s[c]] = u;
        s[++ c] = u;
    }

    return root;
}

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