HDOJ 题目2473 Junk-Mail Filter(并查集,删点)
来源:互联网 发布:seo网络营销是什么 编辑:程序博客网 时间:2024/05/19 03:21
Junk-Mail Filter
Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6406 Accepted Submission(s): 2031
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 ≤ 105 , 1 ≤ M ≤ 106), 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 ≤ 105 , 1 ≤ M ≤ 106), 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 6M 0 1M 1 2M 1 3S 1M 1 2S 33 1M 1 20 0
Sample Output
Case #1: 3Case #2: 2
Source
2008 Asia Regional Hangzhou
Recommend
lcy | We have carefully selected several similar problems for you: 2469 2464 2471 2470 2468
ac代码
#include<stdio.h>#include<string.h>int pre[2200000],flag[2200000];int n,m,id;int find(int x){if(x==pre[x])return x;elsereturn pre[x]=find(pre[x]);}void join(int a,int b){int fa,fb;fa=find(a);fb=find(b);if(fa!=fb){pre[fb]=fa;}}void del(int a){pre[a]=id++;}int main(){//int n,m;int cot=0;while(scanf("%d%d",&n,&m)!=EOF,n||m){int i;id=n+n;for(i=0;i<n;i++)pre[i]=i+n;for(i=n;i<=n+n+m;i++)pre[i]=i;for(i=0;i<m;i++){char c;getchar();scanf("%c",&c);if(c=='M'){int a,b;scanf("%d%d",&a,&b);join(a,b);}else{int a;scanf("%d",&a);del(a);}}int ans=0;memset(flag,0,sizeof(flag));for(i=0;i<n;i++){int x=find(i);if(flag[x]==0){ans++;flag[x]=1;}}printf("Case #%d: %d\n",++cot,ans);}}
0 0
- HDOJ 题目2473 Junk-Mail Filter(并查集,删点)
- hdoj Junk-Mail Filter 2473 (并查集的删点) 好题
- HDOJ 2473 Junk-Mail Filter(并查集集合删点+虚拟父节点)
- HDU 2473 Junk-Mail Filter 删点并查集
- HDU 2473 Junk-Mail Filter 删点并查集
- HDU 2473Junk-Mail Filter 【并查集,删点】
- HDU 2473 Junk-Mail Filter 并查集 删点
- hdu2473 Junk-Mail Filter(删点并查集)
- hdoj 2473 Junk-Mail Filter 并查集的删除
- hdoj 2473 Junk-Mail Filter 【并查集的删除 】
- HDU 2473 Junk-Mail Filter (删点并查集)
- hdu 2473 Junk-Mail Filter 并查集 删除点
- Junk-Mail Filter(hdu2473并查集+删点操作)
- Junk-Mail Filter(并查集)
- HDOJ 2473 Junk-Mail Filter(并查集 要用到代理的思想)
- hdu2473 Junk-Mail Filter(并查集(虚拟父亲)+删点)
- HDOJ 2473 Junk-Mail Filter(并查集删点)
- hdu_2473 Junk-Mail Filter 并查集
- 【连通图|点连通度】POJ-1966 Cable TV Network
- 解决Shockwave flash在谷歌浏览器上崩溃的问题
- 智能体2月6号记录
- 谷歌浏览器(Chrome)遇到Flash崩溃的处理办法
- 最小割 Stoer-Wagner 算法
- HDOJ 题目2473 Junk-Mail Filter(并查集,删点)
- [原创]10个人都不坐在自己座位上有多少种可能机率多大
- 字符串-04. 字符串逆序(15)
- 字符串-05. 字符串循环左移(20)
- NS3的安装(一)
- 弹出表情气泡&仿魔兽的技能冷效果却实现
- 08-1. 求一批整数中出现最多的个位数字(20)
- Bash 通过上下键更有效的查找历史命令
- HDOJ 2024 C语言合法标识符(水题,讲讲标识符)