应该可以dfs
查看原帖
应该可以dfs
1251156
mpansoutlook楼主2025/1/22 16:08

AC代码:

#include<bits/stdc++.h>
#define int long long
#define itn int
#define tin int
#define tni int
#define nit int
#define nti int
using namespace std;
vector<int> vec[100009];
bool vis[5009];
int ans = 0;
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = x * 10 + ch - 48;
		ch = getchar();
	}
	return x * f;
}
void dfs(int x) {
	ans++;
	if (vec[x].size() == 0)return;
	for (auto e : vec[x]) {
		if (!vis[e]) {
			vis[e] = 1;
			dfs(e);
		}
	}
}
signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	n = read();
	for (int i = 1; i <= n; i++) {
		int k;
		k = read();
		if (k == 0);
		else
			for (int j = 1; j <= k; j++) {
				int x;
				x = read();
				vec[i].push_back(x);
			}
	}
	dfs(1);
	cout << ans << endl;
	return 0;
}

2025/1/22 16:08
加载中...