Submission #998271

#TimeUsernameProblemLanguageResultExecution timeMemory
998271ttamxSeptember (APIO24_september)C++17
100 / 100
152 ms10928 KiB
#include<bits/stdc++.h> using namespace std; using vi = vector<int>; int solve(int n,int m,vi f,vector<vi> s){ vector<vi> adj(n); vi vis(n); for(int i=1;i<n;i++)adj[f[i]].emplace_back(i); int cnt=0; function<void(int)> dfs=[&](int u){ if(vis[u])return; vis[u]=1,cnt++; for(auto v:adj[u])dfs(v); }; int ans=0; for(int i=0;i<n-1;i++){ for(int j=0;j<m;j++)dfs(s[j][i]); ans+=!--cnt; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...