3538144_ac_282ms_448k.cc

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

int n;
int p[20001], len[20001];

inline int f(int n)
{
	return (n < 0 ? -n : n) % 1000;
}

inline int findSet(int x)
{
	if (x != p[x])
	{
		int t = p[x];
		p[x] = findSet(t);
		len[x] += len[t];
		return p[x];
	}
	else
		return x;
}

int main()
{
	int i, cas;
	char com[2];
	int a, b;

	scanf("%d", &cas);
	while (cas-- > 0)
	{
		scanf("%d", &n);
		for (i = 0; i < n; i++)
		{
			len[i] = 0;
			p[i] = i;
		}
		while (true)
		{
			scanf("%s", com);
			if (com[0] == 'I')
			{
				scanf("%d%d", &a, &b);
				a--;b--;
				p[a] = findSet(b);
				len[a] = f(a - b) + len[b];
				continue;
			}
			if (com[0] == 'E')
			{
				scanf("%d", &a);
				a--;
				findSet(a);
				printf("%d\n", len[a]);
				continue;
			}
			break;
		}
	}
	return 0;
}