Submission #1200525

#TimeUsernameProblemLanguageResultExecution timeMemory
1200525meligy1229월 (APIO24_september)C++20
0 / 100
1097 ms4928 KiB
#include<bits/stdc++.h> #include "september.h" using namespace std; #define ll long long #define Meligy ios_base::sync_with_stdio(false); cin.tie(NULL); const int N=2e5 + 5; vector<ll>adj[N]; bool vis[N]; set<int>st; void bfs(int s){ queue<int>q; vis[s]=1; q.push(s); while(!q.empty()) { int cur=q.front(); q.pop(); for(auto &v:adj[cur]){ if(vis[v])continue; st.insert(v); vis[v]=1; q.push(v); } } } int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S){ for(int i=1;i<N;i++){ adj[F[i]].push_back(i); } int ans=0; for(int i=0;i<N-1;i++){ if(!vis[S[0][i]]){ bfs(S[0][i]); } else{ st.erase(st.find(S[0][i])); } if(st.empty())ans++; } 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...