| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1173036 | Robert_junior | September (APIO24_september) | C++20 | 0 ms | 0 KiB | 
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
vector<int>g[N];
int sz[N], pr[N];
void dfs(int v, int p){
    pr[v] = p;
    sz[v] = 1;
    for(auto to : g[v]){
        if(to == p) continue;
        dfs(to, v);
        sz[v] += sz[to];
    }
}
int main(){
    int N, M;
    cin>>N>>M;
    vector<int> F(N);
    vector<vector<int>> S(M, vector<int>(N));
    for(int i = 0; i < N; i++){
        cin>>F[i];
    }
    for(int i = 0; i < M; i++){
        for(int j = 0; j < N - 1; j++){
            cin>>S[i][j];
        }
    }
    vector<int>cnt(N);
    for(int i = 1; i < N; i++){
        g[F[i]].push_back(i);
        g[i].push_back(F[i]);
        sz[i] = cnt[i] = pr[i] = 0;
    }
    dfs(0, 0);
    int cur = 0;
    int ans = 0;
    int j = 0;
    while(j < N - 1){
        for(int i = 0; i < M; i++){
            cnt[S[i][j]]++;
            if(sz[S[i][j]] > 1){
                
            }
            if(cnt[S[i][j]] == M){
                cur++;
                sz[pr[S[i][j]]]--;
            }
        }
        if(cur == j + 1) ans++;
        j++;
    }
    cout<<ans;
}
