Submission #1152699

#	Time	Username	Problem	Language	Result	Execution time	Memory
1152699		burgerguy	September (APIO24_september)	C++20	45 / 100	250 ms	21192 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);
    }

    ll possibleDays = INT_MAX;

    for(vector<int> record : S) {
        set<ll> curProcessing;
        vector<set<ll>> tree = initialTree;

        ll curDays = 0;

        for(int e : record) {
            curProcessing.insert(tree[e].begin(), tree[e].end());
            curProcessing.erase(e);

            tree[F[e]].erase(e);

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

        possibleDays = min(possibleDays, curDays);
    }

    return possibleDays;
}

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