Junk-Mail Filter |
Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 364 Accepted Submission(s): 119 |
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 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 |
Source
题目大意:
给出 M 操作是 将 a b 关系起来, S 是删除 a 节点。最后问有多少独立的集合。
思路:
这里学到了一个新的东西,就是虚拟父节点,就是假设我们现在有节点 0 1 2 3 4 将他们的父节点设为 5 6 7 8 9
然后合并正常合并,删除节点的时候就为 这个节点再申请一个 额外的 父节点,最后统计他们有多少个独立的节点。
AC代码:
|
HDU 2473 Junk-Mail Filter
最新推荐文章于 2023-01-08 23:15:41 发布