Submission #992003

#TimeUsernameProblemLanguageResultExecution timeMemory
992003ttamxSeptember (APIO24_september)C++17
100 / 100
195 ms16536 KiB
#include"september.h" #include<bits/stdc++.h> using namespace std; using vi = vector<int>; int solve(int n,int m,vector<int> f,vector<vector<int>> s){ vector<vi> adj(n),vis(n,vi(m)); vi add(n); for(int i=1;i<n;i++)adj[f[i]].emplace_back(i); int cnt=0; function<void(int,int)> dfs=[&](int u,int i){ if(vis[u][i])return; vis[u][i]=true; if(!add[u])add[u]=true,cnt++; for(auto v:adj[u])dfs(v,i); }; int ans=0; for(int i=0;i<n-1;i++){ for(int j=0;j<m;j++)dfs(s[j][i],j); ans+=--cnt==0; } 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...