48玄关求条

#include <bits/stdc++.h>
using namespace std;
long long n, a[100005], ans, m, f[5005][305], fa;
vector<int>e[6006];

void dfs(int x, int fa) {
	f[x][1] = 1;
	f[x][0] = 0;
	for (auto v : e[x]) {
		if (v == fa)
			continue;
		dfs(v, x);
		f[x][0] += f[v][1];
		f[x][1] += min(f[v][0], f[v][1]);
	}
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		int x, y, yyy;
		cin >> x >> yyy;
		for (int j = 1; j <= yyy; j++) {
			cin >> y;
			e[x].push_back(y);
			e[y].push_back(x);
		}
	}
	dfs(0, -1);
	cout << max(f[0][0], f[0][1]);
	return 0;
}