HDU-2473 Junk-Mail Filter

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
  
  

    题意：说实话题意我也不是很理解，那就直接说核心要求吧，有N个点（从0开始），M个操作，‘M’ x y为将x与y关联，‘S’ x 为将x从关联中移除，但是通过x关联的其他点仍然关联。最后输出该关联图中有几个连通分量。

    思路：很明显的并查集，但是在删除节点上需要做一些手脚，我们让一开始的N个点的位置用一个数组d[]存起来，开始时d[i]=i。随后将某一点移除时将d[x]中的x变为大于n的一个数值，即虚拟节点，之后x点再次连接到图中时使用的是虚拟节点的数值。最后遍历d[]数组查找连通分量个数。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#define INF 0x3f3f3f3f
#define mod 1000000007
#define maxn e9

using namespace std;

int arr[2000000],d[2000000],Hash[2000000];
int Find(int r)
{
    return arr[r]==r?r:arr[r]=Find(arr[r]);
}
void Union(int x,int y)
{
    int fx=Find(x);
    int fy=Find(y);
    if(fx!=fy)
    {
        arr[fx]=fy;
    }
}
int main()
{
    int i,j=1;
    int n,m,x,y;
    char c;
    while(scanf("%d%d",&n,&m),n||m)
    {
        int ans=0;
        memset(Hash,0,sizeof(Hash));
        for (i=0;i<2000000;i++)
        {
            d[i]=i;
            arr[i]=i;
        }
        int t=n;
        while(m--)
        {
            scanf("%*c%c",&c);
            if(c=='M')
            {
                scanf("%d%d",&x,&y);
                Union(d[x],d[y]);
            }
            else
            {
                scanf("%d",&x);
                d[x]=t++;
            }
        }
        for (i=0;i<n;i++)
        {
            x=Find(d[i]);
            if(!Hash[x])
            {
                Hash[x]++;
                ans++;
            }
        }
        printf("Case #%d: %d\n",j++,ans);
    }
    return 0;
}