hdu 2473 Junk-Mail Filter(删除节点操作的并查集)
来源:互联网 发布:ubuntu有什么用 编辑:程序博客网 时间:2024/05/17 04:33
Junk-Mail Filter
Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5997 Accepted Submission(s): 1907
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
题意:
M:把两个数合并到同一个集合中,
S:把一个数从这个集合中删除(其他本来在这个集合中得数都仍属于这个集合,不管和这个数有没关联)
输出:集合的个数
思路(如何删除节点不影响该节点下面的点):
把被删掉的那个点设为虚点,并新建一个点,把原来的点映射到这个新点上,用real[a]表示a映射过去的点,没有映射的仍是它本身。有了映射以后的操作都是对这个新点进行操作的。最后数一下根节点的个数就是集合数。
0 0
- hdu 2473 Junk-Mail Filter(删除节点操作的并查集)
- HDU 2473 Junk-Mail Filter(并查集删除节点)
- HDU 2473 ( Junk-Mail Filter ) (并查集删除操作)
- HDU-2473 Junk-Mail Filter 并查集的删除
- Hdu 2473 Junk-Mail Filter (并查集的删除)
- hdu 2473 Junk-Mail Filter (并查集的删除)
- HDU 2473 Junk-Mail Filter(并查集的删除操作)
- hdu 2473 Junk-Mail Filter(并查集的删除操作)
- HDU 2473 Junk-Mail Filter (并查集的删除操作)
- HDU 2473 Junk-Mail Filter (并查集的删除操作)
- HDU-2473-Junk-Mail Filter-并查集的删除操作
- Hdu 2473(并查集删除操作) Junk-Mail Filter
- HDU 2473 Junk-Mail Filter(并查集 | 删除操作)
- hdu 2473 Junk-Mail Filter 并查集删除
- HDU 2473 Junk-Mail Filter 并查集 惰性删除
- hdu 2473 Junk-Mail Filter 并查集 删除点
- hdu 2473 Junk-Mail Filter 并查集删除
- HDU 2473-Junk-Mail Filter-并查集删除
- INADDRANY
- 《炒股的智慧》读后感
- 【老李的模拟赛】【#8	】【2014-08-14|15】
- 如何在Windows平台上创建以点(.)开头的文件名
- HDU2602:Bone Collector(01背包)
- hdu 2473 Junk-Mail Filter(删除节点操作的并查集)
- php in_arry() 用法
- STDIN_FILENO与stdin区别
- jQuery Mobile 组件 之 表单
- 几种经典的网络服务器架构模型的分析与比较
- jQuery学习笔记之十三------Ajax进阶
- ffmpeg 视频转换、图片批量提取
- MyEclipse2013中web项目改名后部署路径不变的解决方法
- POJ2762-Going from u to v or from v to u?(Tarjan缩点,DAG判直链)