Submission #1360722

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360722		ramez-hammad	9월 (APIO24_september)	C++20	100 / 100	93 ms	10868 KiB

september

#include <bits/stdc++.h>

using namespace std;

#define pb push_back

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
    vector<vector<int>> children(N); for (int i=1;i<N;i++) children[F[i]].pb(i);
    vector<int> seen(N);
    int ver=0;
    vector<int> seg;
    int ans=0;
    for (int i=0;i<N-1;i++) {
        for (int j=0;j<M;j++) {
            seen[S[j][i]]++;
            if (seen[S[j][i]]==1) {ver++; seg.pb(S[j][i]);};
            if (seen[S[j][i]]==M) ver--;
        }
        if (ver==0) {
            bool valid_tree=true;
            for (int u : seg) { 
                for (int c : children[u]) if (!seen[c]) {valid_tree=false; break;}
                if (!valid_tree) break;
            }
            if (valid_tree) {ans++; seg.clear();}
        }
    }
    return ans;
}

• 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