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. Note that a node is an ancestor of itself.

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

题意：

在一个树中，每一个节点都会有一个父亲节点；树的根节点就一直是1；

给你两个数字N和M，代表这棵树有N个节点，M代表有M个操作语句；

下面有N-1个数字，代表2---N这些节点的父亲节点；

下面的M行驶操作语句；

每一组操作语句是一个字符C和一个数字W；

如果C==‘M'，代表节点W被标记了；

如果C==’Q，代表要你求出来节点W的父亲节点；

最后输出所有要求出来的父亲节点的总和；

思路：

直接简单并查集，记得用一个数组来记录这个节点是否被标记了；

如果标记了，那么久递归判断出来最早的节点，求和；

注意数据的范围，要用long long；

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int N=100010;

int n,m;
char s[10];
int f[N];//父亲节点；
int k,q;
int book[N];//标记是否被标记过；

int getf(int v)
{
    int w=v;
    while(book[w]==0&&w!=f[w])//递归，找到最早的节点；
    {
        w=f[w];
    }
    return w;
}

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        if(n==0&&m==0)//结束；
            break;
        memset(book,0,sizeof book);
        book[1]=1;//根节点被标记了；
        for(int i=2; i<=n; i++)
        {
            scanf("%d",&k);
            f[i]=k;
        }
        long long int sum=0;//数据范围太大了，注意范围；
        while(m--)
        {
            scanf("%s%d",s,&q);
            if(s[0]=='M')//标记；
            {
                book[q]=1;
            }
            else if(s[0]=='Q')//查询；
            {
                sum+=getf(q);
            }
        }
        printf("%lld\n",sum);
    }
    return 0;
}