Junk-Mail Filter
来源:互联网 发布:mac 维修 编辑:程序博客网 时间:2024/05/18 03:44
Submit: 160 Accepted:47
Time Limit: 2000MS Memory Limit: 65536K
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
并查集,但是要注意拆点的情况(注意如何初始化)
#include<iostream>
#include<algorithm>
using namespace std;
#define inf 1000000000
#define maxn 2100
int n,m;
int fat[2300000],CN;
int a[1000005];
int find(int x)
{
if(x!=fat[x])
fat[x]=find(fat[x]);
return fat[x];
}
int main()
{
int i,j,cas=1,x,y,p1,p2;
char s[10];
while(scanf("%d%d",&n,&m),n|m)
{
/* 这里初始化时并没有让每个点指向自身,而是指向i+n, 这样初始化是为了拆分时的操作 */
for(i=0;i<n;i++)
fat[i]=i+n;
for(i=n;i<=n+m+n;i++)
fat[i]=i;
CN=n+n;
for(i=0;i<m;i++)
{
scanf("%s",s);
if(s[0]=='M')
{
scanf("%d%d",&x,&y);
p1=find(x);
p2=find(y);
if(p1!=p2)
{
fat[p1]=p2;
}
}
/* 如果要拆分该点,直接让它指向一个新节点就可以了,初始化就是为了这一步拆分不会影响到集合中的其他节点 */
else if(s[0]=='S')
{
scanf("%d",&x);
fat[x]=CN++;
}
}
for(i=0;i<n;i++)
a[i]=find(i);
sort(a,a+n);
int ans=1;
for(i=1;i<n;i++)
{
if(a[i]!=a[i-1])
ans++;
}
printf("Case #%d: %d\n",cas++,ans);
}
return 0;
}
原文链接
http://hi.baidu.com/aconly/blog/item/91062962008e81690c33faa1.html
- hdu2473 Junk-Mail Filter
- Junk-Mail Filter
- Junk-Mail Filter
- Junk-Mail Filter
- 2473 Junk-Mail Filter
- hdu2473 Junk-Mail Filter
- Junk-Mail Filter
- HDU 2473 Junk-Mail Filter
- hdoj 2473 Junk-Mail Filter
- HDU 2473 Junk-Mail Filter
- HDU 2473 Junk-Mail Filter
- hud 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
- VINS理论与代码详解5——基于滑动窗口的单目视觉紧耦合后端优化模型
- sql数据库的四大程序设计语言的语句
- Spark的使用方法(二)
- MVP+RXJAVA+Retrofit+Fresco实现简单的效果
- 华硕固件中frp启动问题
- Junk-Mail Filter
- Postman模拟Request Payload发送请求
- 软件工程概述
- jquery table表格添加删除数据(含批量删除,全选全不选和简单的表单验证)
- 第六讲 流程控制语句
- 通过设置规则生成各种单据编号(二)
- JAVA反射会降低你的程序性能吗?
- Struts2核心技术(三)
- Python爬取特朗普就职演讲稿,使用ngram模型进行数据清洗