2473 Junk-Mail Filter

Junk-Mail Filter

Time Limit: 15000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6635    Accepted Submission(s): 2119

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
  
  

 

这道题核心就是虚拟父节点，

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=100005*2;
int pre[maxn],mark[maxn];
int flag[maxn];
int n,m;
int Find(int x)
{
    int r=x;
    while(r!=pre[r]) r=pre[r];
    int i=x,j;
    while(pre[i]!=r)
    {
        j=pre[i];
        pre[i]=r;
        i=j;
    }
    return r;
}
void join(int x,int y)
{
    int fx=Find(x);
    int fy=Find(y);
    if(fx!=fy) pre[fx]=fy;
}
int main()
{
    int num=0;
    while(scanf("%d%d",&n,&m)!=EOF&&(n||m))
    {
        int k=n;//虚结点初始值
        for(int i=0;i<n;i++)
        {
            pre[i]=i;
            mark[i]=i;
        }
        while(m--)
        {
            char order;
            int x,y,z;
         cin>>order;
          if(order=='M')
          {
                cin>>x>>y;
                join(mark[x],mark[y]);
          }
          else
          {
              cin>>z;
              mark[z]=k;
              pre[k]=k;<span class="comment" style="margin: 0px; padding: 0px; border: none; color: rgb(0, 130, 0); font-family: Consolas, 'Courier New', Courier, mono, serif; line-height: 18px;">//新虚结点给定初始父节点，类似于set[i]=i;</span><span style="margin: 0px; padding: 0px; border: none; font-family: Consolas, 'Courier New', Courier, mono, serif; line-height: 18px;">  </span>
              k++;
          }

         }
         int countn=0;
         memset(flag,0,sizeof(flag));
         for(int i=0;i<n;i++)
            if(flag[Find(mark[i])]==0)//去找父节点，看父节点个数
            {
                flag[Find(mark[i])]=1;
                countn++;
            }
            printf("Case #%d: %d\n",++num,countn);
    }
    return 0;
}