# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160388 | mentalmath231 | September (APIO24_september) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int cnt = 0;
vector<int> visited(100002,0);
vector<vector<int>> kid(100002,vector<int>());
void dfs(int x){
if (!visited[x]){
cnt +=1;
visited[x] = 1;
for (auto i: kid[x]){
dfs(i);
}
}
}
int solve(int n, int m, vector<int> f, vector<vector<int>> s) {
int ans = 0;
for (int i =1; i<n; i++){
kid[f[i]].push_back(i);
}
for (int i =0; i<n-1; i++){
dfs(s[0][i]);
if (cnt == i+1){
ans +=1;
}
}
return ans;
}
int main(){
cout<<solve(3, 1, {-1, 0, 0}, {{1, 2}});
}