제출 #1181127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1181127		thangdz2k7	9월 (APIO24_september)	C++20	100 / 100	171 ms	11392 KiB

september

#include <bits/stdc++.h>

using namespace std;

int solve(int N, int M, vector <int> F, vector <vector <int>> S){

    vector <vector <int>> adj(N);
    for (int i = 1; i < N; ++ i)
        adj[F[i]].push_back(i);


    vector <int> cnt(N, 0), vis(N, 0);
    int numm = 0, numt = 0;

    auto add = [&](int u) -> void {
        cnt[u] ++;
        if (cnt[u] == M) numm ++;

        queue <int> qu;
        if (!vis[u]) qu.push(u);
        while (qu.size()){
            int u = qu.front(); qu.pop();
            vis[u] = 1; numt ++;

            for (int v : adj[u]) if (!vis[v])
                qu.push(v);
        }
    };

    int ans = 0;
    for (int i = 0; i < N - 1; ++ i){
        for (int j = 0; j < M; ++ j)
            add(S[j][i]);

        if (numm == numt) ans ++;
    }

    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