# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1198520 | reyleigh | September (APIO24_september) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 7;
vector<int> g[N];
bool vis[N];
void dfs(int u) {
vis[u] = true;
for (auto v: g[u]) {
if (!vis[v]) {
dfs(v);
}
}
}
int solve(int n, int m, vector<int> f, vector<vector<int>> s) {
for (int i = 1; i < n; i++) {
g[f[i]].push_back(i);
}
int ans = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n - 1; j++) {
if (!vis[s[i][j]]) {
dfs(s[i][j]);
ans++;
}
}
}
return ans;
}
/*int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m; cin >> n >> m;
vector<int> f(n);
for (int i = 0; i < n; i++) {
cin >> f[i];
}
vector<vector<int>> s(m, vector<int>(n));
for (int i = 0; i < m; i++) {
for (int j = 0; j < n - 1; j++) {
cin >> s[i][j];
}
}
solve(n, m, f, s);
}