Message Flood SDUT
2015-07-28 16:58
232 查看
Message Flood
Time Limit: 1500ms Memory limit: 65536K 有疑问?点这里^_^
题目描述
Well, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and benefits people a lot". However, If you ask Merlin this question on the New Year's Eve, he will definitely answer "Whata trouble! I have to keep my fingers moving on the phone the whole night, because I have so many greeting message to send!" Yes, Merlin has such a long name list of his friends, and he would like to send a greeting message to each of them. What's worse, Merlin
has another long name list of senders that have sent message to him, and he doesn't want to send another message to bother them Merlin is so polite that he always replies each message he receives immediately). So, before he begins to send message, he needs
to figure to how many friends are left to be sent. Please write a program to help him. Here is something that you should note. First, Merlin's friend list is not ordered, and each name is alphabetic strings and case insensitive. These names are guaranteed
to be not duplicated. Second, some senders may send more than one message to Merlin, therefore the sender list may be duplicated. Third, Merlin is known by so many people, that's why some message senders are even not included in his friend list.
输入
There are multiple test cases. In each case, at the first line there are two numbers n and m (1<=n,m<=20000), which is the number of friends and the number of messages he has received. And then there are n lines of alphabetic strings(thelength of each will be less than 10), indicating the names of Merlin's friends, one per line. After that there are m lines of alphabetic strings, which are the names of message senders. The input is terminated by n=0.
输出
For each case, print one integer in one line which indicates the number of left friends he must send.示例输入
5 3 Inkfish Henry Carp Max Jericho Carp Max Carp 0
示例输出
3
裸的字典树,只不过利用标记一个单词的结束,并且一个人不能多次的发信息,故还有另一标记变量。
#include <bits/stdc++.h> #include<ctype.h> using namespace std; struct node { int next[30]; int bj,j; }q[5000000]; int top,e; char s[1000]; int cs() { memset(q[top].next,-1,sizeof(q[top].next)); q[top].bj=0; q[top].j=0; return top++; } void bu(int k,char s[]) { int i,j,l; l=strlen(s); for(i=0;i<l;i++) { s[i]=tolower(s[i]); j=s[i]-'a'; if(q[k].next[j]==-1) { q[k].next[j]=cs(); } k=q[k].next[j]; } q[k].bj=1; } int lo(int k,char s[]) { int i,j,l; l=strlen(s); for(i=0;i<l;i++) { s[i]=tolower(s[i]); j=s[i]-'a'; if(q[k].next[j]==-1) { return 0; } k=q[k].next[j]; } if(q[k].bj==1) { if(q[k].j==0) { e++; q[k].j++; } } return q[k].bj; } int main() { int n,m,i,k; while(cin>>n&&n) { top=e=0; cin>>m; k=cs(); for(i=0;i<n;i++) { cin>>s; bu(k,s); } for(i=0;i<m;i++) { cin>>s; lo(k,s); } cout<<n-e<<endl; } return 0; }
相关文章推荐
- JAVA-System.arraycopy方法的使用
- (最小费用最大流)The Exchange of Items (141 - ZOJ Monthly, July 2015 - E )
- IDFactory int类型ID生成器
- python学习
- Object-C中常用的方法及其功能
- EOS学习之jwc
- pop动画
- discuz搬家发布不了文章
- 元素样式控制
- iOS开发问题之:应用语言是英文
- 单元测试覆盖率生成网页报告----(四)
- Virtualbox+ubuntu设置共享文件夹
- git 教程
- php面向对象之final static const关键字的使用
- 基于Linux流量控制系统功能简介
- js删除数组元素
- MySQL 性能调优的10个方法
- Mac 批量删除 .svn 文件
- android 线程池的源码分析
- [__NSCFNumber length]: unrecognized selector sent to instance 0xb000000000000022