| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1165696 | em4ma2 | September (APIO24_september) | C++20 | 0 ms | 0 KiB | 
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define pb push_back
#define applejuice ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
const int mxsz=1e5+4;
int cnt=0;
vector<int>vis(mxsz);
vector<vector<int>>adj(mxsz);
void dfs(int i) {
    if (!vis[i]) {
        vis[i] = 1;
        cnt++;
        for (auto x: adj[i]) {
            dfs(x);
        }
    }
}
int solve(int n,int m,vector<int>f,const vector<vector<int>>s){
    int ans=0;
    cnt=0;
    vis=vector<int>(mxsz,0);
    adj=vector<vector<int>>(mxsz);
    for (int i=1;i<n;i++){
        adj[f[i]].pb(i);
    }
    for (int i=0;i<n-1;i++){
        for (int j=0;j<m;j++){
            dfs(s[j][i]);
        }
        if (cnt==i+1)ans++;
    }
    return ans;
}
int main(){
    applejuice;
    int n,m;
    cin>>n>>m;
    vector<int>a(n);
    for (int i=0;i<n;i++){
        cin>>a[i];
    }
    vector<vector<int>>s(m);
    for (int i=0;i<m;i++){
        s[i]=vector<int>(n-1);
        for (int j=0;j<n-1;j++) {
            cin >> s[i][j];
        }
    }
    cout<<solve(n,m,a,s);
}
