5.1.5 JunkMail Filter

Junk-Mail Filter

Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 181 Accepted Submission(s): 62

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 <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;

const int maxn=100010,maxm=1000010;
int cases,cnt,ans,fx,fy,a,b,n,m;
int f[maxn+maxm],r[maxm+maxn];
bool flag[maxn+maxm];
char s[2];

void close()
{
    fclose(stdin);
    fclose(stdout);
    exit(0);
}

int find(int k)
{
    if (f[k]==k)
        return k;
    return f[k]=find(f[k]);
}

void merge(int x,int y)
{
    fx=find(x);
    fy=find(y);
    if (fx!=fy)
        f[fx]=fy;
}

void work()
{
}

void init ()
{
freopen("spam.in","r",stdin);
freopen("spam.out","w",stdout);
cases=0;
    while(scanf("%d %d",&n,&m)!=EOF)
     {
         memset(flag,false,sizeof(flag));
         memset(r,0,sizeof(r));
         memset(f,0,sizeof(f));
         cases++;
         cnt=0;
         if (n==0 && m==0) break;
         for (int i=0;i<n;i++)
         {
             f[i]=i;
             r[i]=i;
         }
         cnt=n-1;
         for (int i=1;i<=m;i++)
         {
             scanf("%s",s);
             if (s[0]=='M')
             {
                 scanf("%d %d",&a,&b);
                 merge(r[a],r[b]);
             }
             else
             {
                 scanf("%d",&a);
                 //flag[a]=true;
                 cnt++;
                 f[cnt]=cnt;
                 r[a]=cnt;
             }
         }
         ans=0;
         for (int i=0;i<n;i++)
         {
             int t=find(r[i]);
             if (not flag[t])
             {
                 flag[t]=true;
                 ans++;
             }
         }
         printf("Case #%d: %d\n",cases,ans);
     }
}

int main ()
{
    init();
    work();
    close();
    return 0;
}