Message Flood SDUT OJ 1500
来源:互联网 发布:js添加隐藏属性 编辑:程序博客网 时间:2024/05/11 18:00
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 "What a 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(the length 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 3InkfishHenryCarpMaxJerichoCarpMaxCarp0
示例输出
3
#include <stdio.h>#include <string.h>struct node{ int next[26]; bool mark;} dd[633333];int top,count;int creat(){ memset(dd[top].next,-1,sizeof(dd[top].next)); dd[top].mark=false; return top++;}int xiab(char c){ if(c>='a'&&c<='z') return c-'a'; else if(c<='Z'&&c>='A') //注意开头字母大写问题 return c-'A';}void insert(int root,char *s){ int i,len=strlen(s); for(i=0; i<len; i++) { if(dd[root].next[xiab(s[i])]==-1) dd[root].next[xiab(s[i])]=creat(); root=dd[root].next[xiab(s[i])]; } dd[root].mark=true;}int search(int root,char *s){ int i,len=strlen(s); for(i=0; i<len; i++) { if(dd[root].next[xiab(s[i])]==-1) return 0; root=dd[root].next[xiab(s[i])]; } if(dd[root].mark) count++; return 0;}char s[200];char st[200100][20];int main(){ int root; int i,m,n; while(scanf("%d",&n)&&n) { scanf("%d",&m); top=0; count=0; root=creat(); for(i=0; i<n; i++) { scanf("%s",st[i]); } for(i=0; i<m; i++) { scanf("%s",s); insert(root,s); } for(i=0; i<n; i++) search(root,st[i]); printf("%d\n",n-count); } return 0;}
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 "What a 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(the length 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 3InkfishHenryCarpMaxJerichoCarpMaxCarp0
示例输出
3
0 0
- Message Flood SDUT OJ 1500
- sdut 1500 Message Flood
- Message Flood SDUT 1500
- sdut 1500 Message Flood
- SDUT 1500-Message Flood(set)
- SDUT Message Flood
- Message Flood SDUT
- sdut Message Flood
- SDUT-Message Flood
- SDUT 1500 Message Flood(字典树 && 模板)
- SDUT 1500 Message Flood (快排+二分查找)
- 南邮 OJ 1121 Message Flood
- SDUTOJ 1500 Message Flood 【STL】
- 【1500】Message Flood (SDUTOJ)
- Message Flood
- Message Flood
- Message Flood
- Message Flood
- 快速掌握HTML
- UVA - 400 Unix ls
- javase简单入门6 方法的传参,Stati
- 金额转换成大写
- vim初来乍到之二:vim配置
- Message Flood SDUT OJ 1500
- anyarg: C++命令行参数解析
- 算法导论 第十章 10.2-8 用单指针域实现双链表
- hdu 1966 Minimax Triangulation
- socket 错误码
- Android系统Gps分析(一)
- 关于游戏数据分析的工具的一些思考
- javase简单入门7 重载,继承,代码块
- B2B-供应产品生命周期核心状态