Marked Ancestor Aizu - 2170（并查集+暴力）

Marked Ancestor Aizu - 2170

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

题意：
有N个点，Q次操作。每个点的写着父亲节点的下标。
M表示标记节点，Q表示查询，每次查询ans都加上最近的标记过的父亲节点。

题解1：
当数据很小时，暴力去找父亲节点是可取的。
vj上的数据就很小。
所以下面是vj上AC的代码。

#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
struct D {
	int num,k;
};
D a[100100];
int main() {
	int N, Q;
	while (~scanf("%d%d",&N, &Q)) {
		if (N == 0 && Q == 0)break;
		a[1].k = 1;a[1].num = 1;
		for (int i = 2; i <= N; i++) {
			scanf("%d",&a[i].num);
			a[i].k = 0;
		}
		char s; int t;
		long long ans = 0;
		for (int i = 1; i <= Q; i++) {
			cin >> s >> t;
			if (s == 'M') a[t].k = 1;
			else {
				for (int j = t; a[j].num >= 1;) {
					if (a[j].k == 1) {
						ans+=j;
						break;	
					}
					j = a[j].num;
				}
			}
		}
		printf("%lld\n",ans);
	}
}

题解2：

每一次标记后，如果向上找父亲节点的时候，遇到这个点，那么就输出。可以理解为，每一次标记后。父亲节点就是自己。
查询就是找最近标记过的点，如果向上找标记过的父亲节点，如果标记过，则停止查找，输出。

#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int n, q, fa[N];

int find(int x) {
	if(fa[x] == x) return x;
	return find(fa[x]);
}
int main() {
	while(~scanf("%d%d", &n, &q) && n && q) {
		fa[1] = 1;
		for(int i = 2; i <= n; i++) scanf("%d", &fa[i]);
		long long  ans = 0;
		for(int i = 1; i <= q; i++) {
			char s;
			int x;
			getchar();
			scanf("%c%d", &s, &x);
			if(s == 'Q') ans += find(x);
			else fa[x] = x;
		}
		printf("%lld\n", ans);
	}
	return 0;
}