Submission #1152873

#	Time	Username	Problem	Language	Result	Execution time	Memory
1152873		burgerguy	September (APIO24_september)	C++20	100 / 100	451 ms	17008 KiB

september

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
    vector<set<ll>> initialTree(N);
    for (int i = 1; i < F.size(); i++) {
        initialTree[F[i]].insert(i);
    }

    set<ll> curProcessing;
    map<ll,ll> seen;

    ll curDay = 0;

    for (int i = 0; i < N - 1; i++) {
        for (int j = 0; j < M; j++) {
            curProcessing.insert(S[j][i]);
            seen[S[j][i]]++;

            curProcessing.insert(initialTree[S[j][i]].begin(), initialTree[S[j][i]].end());

            if(seen[S[j][i]] == M) {
                curProcessing.erase(S[j][i]);
                initialTree[F[S[j][i]]].erase(S[j][i]);
            }
        }

        if(curProcessing.empty()) ++curDay;
    }

    return curDay;
}

• Subtask 1: 11 / 11
• Subtask 2: 14 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 5 / 5
• Subtask 6: 11 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 9 / 9
• Subtask 10: 16 / 16