Aizu 2170 Marked Ancestor【并查集】

原题网址：

http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2170

Marked Ancestor

Time Limit : 8 sec, Memory Limit : 65536 KB

Problem F: Marked Ancestor

You are given a tree T that consists of N nodes. Each node is numbered from 1 to N, and node 1 is always the root node of T. Consider the following two operations on T:

• M v: (Mark) Mark node v.
• Q v: (Query) Print the index of the nearest marked ancestor of node v which is nearest to it. Initially, only the root node is marked.

Your job is to write a program that performs a sequence of these operations on a given tree and calculates the value that each Q operation will print. To avoid too large output file, your program is requested to print the sum of the outputs of all query operations. Note that the judges confirmed that it is possible to calculate every output of query operations in a given sequence.

Input

The input consists of multiple datasets. Each dataset has the following format:

The first line of the input contains two integers N and Q, which denotes the number of nodes in the tree T and the number of operations, respectively. These numbers meet the following conditions: 1 ≤ N ≤ 100000 and 1 ≤Q ≤ 100000.

The following N - 1 lines describe the configuration of the tree T. Each line contains a single integer pi (i = 2, ... , N), which represents the index of the parent of i-th node.

The next Q lines contain operations in order. Each operation is formatted as "M v" or "Q v", where v is the index of a node.

The last dataset is followed by a line containing two zeros. This line is not a part of any dataset and should not be processed.

Output

For each dataset, print the sum of the outputs of all query operations in one line.

Sample Input

6 3
1
1
2
3
3
Q 5
M 3
Q 5
0 0

Output for the Sample Input

4

---

Source: ACM-ICPC Japan Alumni Group Summer Camp 2009 , Day 3, Tokyo, Japan, 2009-09-20 
http://acm-icpc.aitea.net/

题意：

给出一棵数，给出每个节点的父节点，初始只有节点1 被标记了，现在有两组操作

1，M a 把 编号为a 的节点加上标记

2，Q a 询问在这棵树上距离a 点最近的被标记的节点的编号

样例以0 0 结束，=对每组数据，输出所有的查询的结果的和....

题解：

并查集的题目，刚开始没注意看输入格式，一直TLE ，还以为是自己的思路有问题呢，在想是不是有什么高级的技巧？

结果发现....原来最裸的并查集都是可以过的............

个人最直接的处理是，开一个标记数组，对于每个节点，如果被标记过，在进行并查集查找的时候，返回第一个被标记的元素的值

否则就翻转状态，添加标记，然后看了大神的思路以后，发现自己原来可以更优化一下的......

另外需要注意的是，最终结果可能会超过int 范围，毕竟最大值可能是100k*50k....

/*
http://blog.csdn.net/liuke19950717
*/
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn=100005;
int pre[maxn],vis[maxn];
int find(int x)
{
	int r=x;
	while(!vis[r]&&r!=pre[r])
	{
		r=pre[r];
	}
	return r;
}
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m),n|m)
	{
		memset(vis,0,sizeof(vis));
		pre[1]=1;
		for(int i=2;i<=n;++i)
		{
			scanf("%d",&pre[i]);
		}
		ll ans=0;
		while(m--)
		{
			char s[10];int x;
			scanf("%s%d",s,&x);
			if(s[0]=='Q')
			{
				ans+=find(x);
			}
			else
			{
				vis[x]=1;
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}

/*
大神的做法：
在添加标记的时候，直接相当于把这棵子树分理出了整棵数，
也就是直接把这个元素的父节点设为自身，这样不但优化了内存，
思路也更清晰....这样也更体现并查集的性质
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn=100005;
int pre[maxn];
int find(int x)
{
	int r=x;
	while(r!=pre[r])
	{
		r=pre[r];
	}
	return r;
}
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m),n|m)
	{
		pre[1]=1;
		for(int i=2;i<=n;++i)
		{
			scanf("%d",&pre[i]);
		}
		ll ans=0;
		while(m--)
		{
			char s[10];int x;
			scanf("%s%d",s,&x);
			if(s[0]=='Q')
			{
				ans+=find(x);
			}
			else
			{
				pre[x]=x;
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}
*/