제출 #991959

#제출 시각아이디문제언어결과실행 시간메모리
991959ttamx9월 (APIO24_september)C++17
100 / 100
226 ms17920 KiB
#include"september.h" #include<bits/stdc++.h> using namespace std; int solve(int n,int m,vector<int> f,vector<vector<int>> s){ vector<vector<int>> adj(n); for(int i=1;i<n;i++)adj[f[i]].emplace_back(i); vector<vector<bool>> vis(n,vector<bool>(5)); vector<bool> added(n); vector<int> cnt(n); multiset<int> ms; function<void(int,int)> dfs=[&](int u,int i){ if(vis[u][i])return; vis[u][i]=true; if(!added[u]){ added[u]=true; for(int i=0;i<m;i++)ms.emplace(u); } 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); for(int j=0;j<m;j++)ms.erase(ms.find(s[j][i])); ans+=ms.empty(); } 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...