Junk-Mail Filter（并查集）

Junk-Mail Filter

Time Limit : 15000/8000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 20 Accepted Submission(s) : 6

Problem Description

Recognizing junk mails is a tough task. The method used here consists of two steps:
1) Extract the common characteristics from the incoming email.
2) Use a filter matching the set of common characteristics extracted to determine whether the email is a spam.

We want to extract the set of common characteristics from the N sample junk emails available at the moment, and thus having a handy data-analyzing tool would be helpful. The tool should support the following kinds of operations:

a) “M X Y”, meaning that we think that the characteristics of spam X and Y are the same. Note that the relationship defined here is transitive, so
relationships (other than the one between X and Y) need to be created if they are not present at the moment.

b) “S X”, meaning that we think spam X had been misidentified. Your tool should remove all relationships that spam X has when this command is received; after that, spam X will become an isolated node in the relationship graph.

Initially no relationships exist between any pair of the junk emails, so the number of distinct characteristics at that time is N.
Please help us keep track of any necessary information to solve our problem.

Input

There are multiple test cases in the input file.
Each test case starts with two integers, N and M (1 ≤ N ≤ 10⁵ , 1 ≤ M ≤ 10⁶), the number of email samples and the number of operations. M lines follow, each line is one of the two formats described above.
Two successive test cases are separated by a blank line. A case with N = 0 and M = 0 indicates the end of the input file, and should not be processed by your program.

Output

For each test case, please print a single integer, the number of distinct common characteristics, to the console. Follow the format as indicated in the sample below.

Sample Input

  
  

   
   5 6
M 0 1
M 1 2
M 1 3
S 1
M 1 2
S 3

3 1
M 1 2

0 0
  
  

Sample Output

  
  

   
   Case #1: 3
Case #2: 2
  
  

Source

2008 Asia Regional Hangzhou

题意：有N封邮件， 然后又两种操作，如果是M X Y ， 表示X和Y是相同的邮件。 如果是S X，那么表示对X的判断是错误的，X是不属于X当前所在的那个集合，要把X分离出来，让X变成单独的一个。假设如下情况
M 0 2
M 1 2
S 2

合并起来后就是一个集合{0,1,2}， 如果把2删除掉之后， {0，1}还是集合

题解：并查集，要把集合中的一个删掉，却很不容易。 这题，学习到了所谓的设立需父节点的方法。
关键的过程是假设要删除x点， 那么不是真的删除x点， 而是通过一个映射（这里用数组majia[N]），把x变成一个新的点即majia[x] = newNode.那么， 原来的那些集合还是不变，只是少了个x点。

#include<cstdio> 
#include<cstring> 
#define N 1100000 
int f[N],rank[N],majia[N],flag[N],id,n,m; 
 
inline void init(){ 
    for(int i=0; i<n; ++i) 
        f[i]=majia[i]=i; 
    memset(rank, 0, sizeof(rank)); 
    id=n; 
} 
int find(int x){ 
    if(x!=f[x])
     f[x]=find(f[x]);
    return f[x];
} 
void Union(int x,int y){ 
    int a=find(x), b=find(y); 
    if(a==b)return ; 
    if(rank[a]>rank[b]) 
        f[b]=a; 
    else{ 
        if(rank[a]==rank[b]) 
            ++rank[b]; 
        f[a]=b; 
    } 
} 
void Delete(int x){ 
    f[id]=id;    
    majia[x]=id++; 
} 
 
 
int main(){ 
    char cmd[3]; 
    int a,b,cas=1; 
    while(~scanf("%d%d",&n,&m)&&n+m){ 
        init(); 
        for(int i=0; i<m; ++i){ 
            scanf("%s",cmd); 
            if(cmd[0]=='M'){ 
                scanf("%d%d",&a,&b); 
                Union(majia[a],majia[b]); 
            } 
            else{ 
                scanf("%d",&a); 
                Delete(a); 
            } 
        } 
        memset(flag, 0, sizeof(flag)); 
        int ans=0; 
        for(int i=0; i<n; ++i){ 
            a=find(majia[i]); 
            if(!flag[a]){ 
                ++ans; 
                flag[a]=1; 
            } 
        } 
        printf("Case #%d: %d\n",cas++, ans); 
    } 
    return 0; 
}