AOJ2170 Marked Ancestor（并查集+离线）

Problem

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个结点的树，编号1-N，1是根结点，有两种操作：
M v：给v结点打标记
Q v：求离v最近的标记祖先结点的编号，自己也算自己的祖先结点。
最初只有根结点被标记，求所有v操作的和。

思路

用mark数组存下每个结点被标记的最早时间，一直没被标记则是INF，用结构体数组Q存下Q操作的时间和结点，离线的方法从Q数组的后面向前计算结果。在t时间访问v结点，向v的祖先方向遍历时，如果祖先的标记时间<t则找到结果，同时以后的访问时间一定小于t，可以沿遍历方向压缩路径。

参考代码

#include <iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>

using namespace std;

typedef long long ll;

const int INF=0x3f3f3f3f;
const int NINF=0xc0c0c0c0;
const int MAX_N=100000+5;

struct dat{
    int t,v;
};

int n,q;
int par[MAX_N+1];
int mark[MAX_N+1];
int m;
dat Q[MAX_N+1];

int find(int x,int t){
    if(mark[x]<t)return x;
    return par[x]=find(par[x],t);
}

int main()
{
    while(scanf("%d%d",&n,&q)!=EOF&&(n||q)){
        for(int i=2;i<=n;i++){
            scanf("%d",par+i);
        }
        char op[2];
        int v;
        memset(mark,0x3f,sizeof(mark));
        mark[1]=0;
        m=0;
        for(int i=1;i<=q;i++){
            scanf("%s%d",op,&v);
            if(op[0]=='M')mark[v]=min(mark[v],i);
            else Q[++m]=(dat){i,v};
        }
        ll res=0;
        for(int i=m;i>=1;i--){
            res+=find(Q[i].v,Q[i].t);
        }
        printf("%lld\n",res);
    }
    return 0;
}