出错了 - 洛谷https://www.luogu.com.cn/problem/P2712
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
int cnt;
int head[MAXN];
int nxt[MAXN];
int ver[MAXN];
int deg[MAXN];
bool vis[MAXN];
inline void add(int x, int y) {
ver[++cnt] = y;
deg[y]++;
nxt[cnt] = head[x];
head[x] = cnt;
}
int ans;
inline void topsort(int r) {
queue<int> que;
for (int i = 0; i <= r; i++) {
if (vis[i] && deg[i] == 0) {
que.push(i);
}
}
while (!que.empty()) {
int x = que.front();
que.pop();
// printf("%d\n", x);
ans++;
for (int i = head[x]; i; i = nxt[i]) {
int y = ver[i];
if (--deg[y] == 0 && vis[y]) {
que.push(y);
}
}
}
}
int main() {
int n;
scanf("%d", &n);
int x, y, c;
int maxx = 0;
for (int i = 1; i <= n; i++) {
scanf("%d %d", &x, &c);
vis[x] = true;
for (int j = 1; j <= c; j++) {
scanf("%d", &y);
add(x, y);
}
maxx = max(x, maxx);
}
topsort(maxx);
if (ans == n) {
printf("YES");
} else {
printf("%d", n - ans);
}
return 0;
}