并查集

 Marked Ancestor  Aizu - 2170 

Problem F:

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

题意： 有n 个数 ，并且给出他的父节点，Q 询问 x的父节点，M 是把x的父节点变成它本身

思路 ： pre数组直接输入，遇到Q 就找x的根节点意压缩路径 和不压缩路径的区别，不需要压缩路径！！！。

压缩路径 会把父节点变成根节点，但是 本题中父节点有可能会变成根节点 跟原来的根节点不一样，但是压缩路径会把原来的根节点当成父节点，会导致错误。

代码：

#include<stdio.h>
typedef long long ll;
int pre[100005];
int finds(int x)
{
    return x == pre[x]? x: finds(pre[x]);//注意与 pre[x] = finds(pre[x]);的区别。
}
int main()
{
    int Q,N;
    while(~scanf("%d%d",&Q,&N)&&Q&&N){
        pre[1] = 1;
        for(int i = 2; i <= Q; i++){
            scanf("%d",&pre[i]);
        }
        ll ans = 0;
        for(int i = 0; i < N;i++){
            char c;
            int x;
            scanf(" %c%d",&c,&x);
            if(c == 'Q') ans += finds(x);
            else pre[x] = x;
        }
        printf("%lld\n",ans);
    }
    return 0;
}