HDU6370 Werewolf【并查集】

 晚点补题解

#include <bits/stdc++.h>

using namespace std;
const int MAXN = 100010;
int tot,head[MAXN],q[MAXN],f[MAXN];
bool vis[MAXN];
char str[10];

struct data {
	int x, role;
} a[MAXN];

struct node {
	int v, nxt;
} edge[MAXN];

void init() {
	tot = 0;
	memset(head, 0, sizeof(head));
	memset(vis, 0, sizeof(vis));
}

void addEdge(int u, int v) {
	++tot;
	edge[tot].v = v;
	edge[tot].nxt = head[u];
	head[u] = tot;
}

int find(int x) {
	if (f[x] == x) return f[x];
	return f[x] = find(f[x]);
}

void join(int x, int y) {
	x = find(x);
	y = find(y);
	if (x == y) return;
	f[x] = y;
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		int n;
		scanf("%d", &n);
		init();
		for (int i = 1; i <= n; i++) f[i] = i;
		for (int i = 1; i <= n; ++i) {
			scanf("%d%s", &a[i].x,str);
			if(str[0] == 'v') {
				a[i].role = 1;
				addEdge(a[i].x,i);
				join(i, a[i].x);
			} else a[i].role = 0;
		}
		int h = -1;
		int t = -1;
		int ans = 0;

		for (int i = 1; i <= n; ++i)
			if (find(i) == find(a[i].x) && a[i].role == 0) {
				q[++t] = a[i].x;
				vis[a[i].x] = 1;
				ans++;
			}

		while (h < t) {
			int x = q[++h];
			for (int i = head[x]; i; i = edge[i].nxt) {
				int y = edge[i].v;
				if (!vis[y]) {
					q[++t] = y;
					vis[y] = 1;
					ans++;
				}
			}
		}
		printf("0 %d\n", ans);
	}
	return 0;
}