Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- #include <cstdio>
- int k[1000][1000];
- int map[1000][1000];
- int vi[1000];
- int n;
- void dfs(int x) {
- for (int i = 1; i <= map[x][0]; i++) {
- if (!vi[map[x][i]]) {
- vi[map[x][i]] = 1;
- dfs(map[x][i]);
- break;
- }
- }
- }
- int main() {
- scanf("%d", &n);
- for (int i = 0; i < n; i++) {
- scanf("%d", &map[i][0]);
- for (int j = 1; j <= map[i][0]; j++) {
- scanf("%d", &map[i][j]);
- }
- }
- int ans = 0;
- for (int i = 0; i < n; i ++) {
- if (!vi[i]) {
- ans ++;
- vi[i] = 1;
- dfs(i);
- }
- }
- printf("%d\n", ans);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement