Submission #1162201

#	Time	Username	Problem	Language	Result	Execution time	Memory
1162201		vahagng	9월 (APIO24_september)	C++20	100 / 100	89 ms	10684 KiB

september

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

const int N = 1e5 + 10;

vector<int> adj[N];
bool visited[N];
int cnt;

void dfs(int node){
    if(visited[node]) return;
    cnt++;
    visited[node] = 1;
    for(auto i : adj[node]){
        dfs(i);
    }
}

int solve(int n, int m, vector<int>par, vector<vector<int>>a){
    cnt = 0;
    for(int i = 1; i <= n; i++){
        adj[i].clear();
        visited[i] = 0;
    }
    for(int i = 1; i < n; i++){
        adj[par[i]].push_back(i);
    }
    int ans = 0;
    for(int i = 0; i < n-1; i++){
        for(int j = 0; j < m; j++){
            dfs(a[j][i]);
        }
        if(cnt == i + 1) 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