poj3694(并查集+lca+tarjan)

题目

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<math.h>
#define N 100010
using namespace std;
struct node
{
	int v, nxt;
}e[4 * N];
int head[N], cnt, ti, ans, n;
int dfn[N], low[N], fa[N], ba[N];
void add(int u, int v)
{
	e[++cnt].v = v;
	e[cnt].nxt = head[u];
	head[u] = cnt;
}
void init()
{
	memset(head, 0, sizeof(head));
	memset(dfn, 0, sizeof(dfn));
	memset(low, 0, sizeof(low));
	for (int i = 1; i <= n; i++)
	{
		fa[i] = i;
	}
	cnt = ti = ans = 0;
}
int find(int x)
{
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}
void tarjan(int u, int fat)
{
	dfn[u] = low[u] = ++ti;
	for (int i = head[u]; i; i = e[i].nxt)
	{
		int v = e[i].v;
		if (!dfn[v])
		{
			ba[v] = u;
			tarjan(v, u);
			low[u] = min(low[u], low[v]);
			if (low[v] > dfn[u])
			{
				ans++;
			}
			else
			{
				fa[find(v)] = find(u);
			}
		}
		else if (v != fat)low[u] = min(low[u], dfn[v]);
	}
}
void lca(int x, int y)
{
	if (dfn[x] < dfn[y])swap(x, y);
	int a, b;
	while (dfn[x] > dfn[y])
	{
		a = find(x), b = find(ba[x]);
		if (a != b)ans--, fa[a] = b;
		x = ba[x];
	}
	while (x != y)
	{
		a = find(y), b = find(ba[y]);
		if (a != b)ans--, fa[a] = b;
		y = ba[y];
	}
}
int main()
{
	int m, num = 0;
	int u, v, q;
	while (scanf("%d%d", &n, &m) && n && m)
	{
		init();
		while (m--)
		{
			scanf("%d%d", &u, &v);
			add(u, v);
			add(v, u);
		}
		scanf("%d", &q);
		tarjan(1,1);
		printf("Case %d:\n", ++num);
		while (q--)
		{
			scanf("%d%d", &u, &v);
			lca(u, v);
			printf("%d\n", ans);
		}
		printf("\n");
	}
	return 0;
}