Junk-Mail Filter
Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7777 Accepted Submission(s): 2456
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.
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 5 , 1 ≤ M ≤ 10 6), 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.
Each test case starts with two integers, N and M (1 ≤ N ≤ 10 5 , 1 ≤ M ≤ 10 6), 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主要是对并查集的应用,先建立集合,每个点一个集合,遇到M时集合合并,遇到S时踢出集合,求集合数量!我们把set[i]=i(实际的集合);mark[i]=i(虚拟的节点);,每次遇到S时虚拟向后一个节点,如此向后,直至结束!然后再看实际的集合数目!代码:#include<stdio.h> #include<string.h> #define N 1000000+100 int n,m,k; int mark[N],set[N]; int flag[N]; void init() { k=n; for(int i=0;i<n;i++) { set[i]=i; mark[i]=i; } } int find(int p) { int t; int child=p; while(p!=set[p]) p=set[p]; while(child!=p) { t=set[child]; set[child]=p; child=t; } return p; } void merge(int x,int y) { int fx=find(mark[x]);//寻找每个节点的父节点(都用虚拟的) int fy=find(mark[y]); if(fx!=fy) set[fx]=fy; } void del(int x)//虚拟的一个集合(用mark与原节点关联) { mark[x]=k; set[k]=k; k++; } int main() { int c=0; int i,j; while(scanf("%d%d",&n,&m)!=EOF&&(n||m)) { c++; init(); char s; int a,b; for(i=0;i<m;i++) { getchar(); scanf("%c",&s); if(s=='M') { scanf("%d%d",&a,&b); merge(a,b);//合并 } else { scanf("%d",&a); del(a);//踢出 } } int marks; memset(flag,0,sizeof(flag)); int count=0; for(i=0;i<n;i++) { marks=find(mark[i]); if(!flag[marks]) { count++; flag[marks]=1; } } printf("Case #%d: %d\n",c,count); } }