Message Flood(字典树)
来源:互联网 发布:知乎怎么删除匿名回答 编辑:程序博客网 时间:2024/05/16 19:42
题目描述
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>#include <stdlib.h>struct node{ int flag; node *next[26];};node *newnode(){ int i; node *p=new node; for(i=0; i<26; i++) { p->next[i]=NULL; } p->flag=0; return p;}void charu(node *root, char *s){ int i, k=strlen(s),t; node *p=root; for(i=0; i<k; i++) { if(s[i]>='A'&&s[i]<='Z') t=s[i]-'A'; else t=s[i]-'a'; if(p->next[t]==NULL) p->next[t]=newnode(); p=p->next[t]; } p->flag=1;}int seach(node *root, char *s){ node *p=root; int i, t, k=strlen(s); for(i=0; i<k; i++) { if(s[i]>='A'&&s[i]<='Z') t=s[i]-'A'; else t=s[i]-'a'; if(p->next[t]==NULL) return 0; p=p->next[t]; } if(p->flag) { p->flag=0; return 1; } return 0;}void del(struct node *p){ int i; for(i=0; i<26; i++) if(p->next[i]!=NULL) del(p->next[i]); free(p); p=NULL;}int main(){ int n, i, j,k, m; char s[20001][20], s0[20]; struct node *p; while(scanf("%d",&n)!=EOF) { if(n==0) break; k=0; scanf("%d",&m); p=newnode(); for(i=0; i<n; i++) { scanf("%s",s[i]); } for(i=0; i<m; i++) { scanf("%s",s0); charu(p, s0); } for(i=0;i<n;i++) { j=seach(p,s[i]); if(j) k++; } printf("%d\n",n-k); del(p); } return 0;}
0 0
- Message Flood(字典树)
- Message Flood(字典树)
- Message Flood《字典树》
- 1150 Message Flood 【字典树】
- A - Message Flood(字典树)
- Message Flood(字典数)
- SDUT 1500 Message Flood(字典树 && 模板)
- Sicilly 1194 Message Flood(字典树+搜索)
- 字典树——Message Flood
- 寒假训练--字典树--Message Flood
- STL --字典树-- Message Flood-----map
- SDUT1500_Message Flood(字典树)
- Message Flood 字典树 小心memset的使用
- SDUTOJ 1500 ——Message Flood 字典树或map
- Message Flood(STL)
- trie树Message Flood
- 【1500】Message Flood (SDUTOJ)
- 【字典树】Message Flood - 第9届中山大学程序设计竞赛预选赛
- MyBatis中对List<Object> 对象List的批处理插入操作
- 系统调用处理程序 系统调用服务例程 关系 区别
- MySQL中日期与时间类型
- 多进程与多线程的深度比较
- mysql备份和恢复的shell脚本样例
- Message Flood(字典树)
- 行内元素和块级元素有哪些
- linux shell if 参数
- Ant中的 unable to locate tools.jar错误解决
- Linux 的细节!
- Unity3D研究院之IOS Android支持中文与本地文件的读取写入
- 传iOS 7.1将在3月15日发布:增强移动设备管理
- 金蝉脱壳
- HDU1257最少拦截系统