洛谷 #2712. 摄像头

题意

有向图，问处在环中的数的个数

题解

拓扑排序，删掉除环外的所有点，再统计答案即可

调试记录

无

#include <cstdio>
#include <queue>
#define maxn 505

using namespace std;

struct node{
	int to, next;
}e[maxn * maxn << 1];
int tot, head[maxn];
void addedge(int u, int v){
	e[++tot] = (node){v, head[u]};
	head[u] = tot;
}

int n, id[maxn], index[maxn];

void Toposort(){
	queue <int> q; while (!q.empty()) q.pop();
	for (int i = 1; i <= n; i++) if (!index[id[i]]) q.push(id[i]);
	
	while (!q.empty()){
		int cur = q.front(); q.pop();
		for (int i = head[cur]; i; i = e[i].next){
			if (index[e[i].to]){
				index[e[i].to]--;
				if (!index[e[i].to]) q.push(e[i].to);
			}
		}
	}
}

int main(){
	scanf("%d", &n);
	
	for (int m, i = 1; i <= n; i++){
		scanf("%d%d", &id[i], &m);
		for (int to, j = 1; j <= m; j++){
			scanf("%d", &to);
			index[to]++;
			addedge(id[i], to);
		}
	}
	
	Toposort();
	int ans = 0;
	for (int i = 1; i <= n; i++){
		if (index[id[i]]) ans++;
	}
	if (ans) printf("%d\n", ans);
	else printf("YES\n");
	
	return 0;
}