poj 2503 Babelfish(字典树或着STL)
来源:互联网 发布:中国网络声优排行榜 编辑:程序博客网 时间:2024/06/12 17:33
Babelfish
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 35828 Accepted: 15320
Description
You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.
Input
Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output
Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".
Sample Input
dog ogdaycat atcaypig igpayfroot ootfrayloops oopslayatcayittenkayoopslay
Sample Output
catehloops
Hint
Huge input and output,scanf and printf are recommended.
Source
Waterloo local 2001.09.22
STL同样秒杀 我就怀疑字典树有个鸡毛用,测试样例太少了吧!
STL:
#include<iostream>#include<sstream>#include<algorithm>#include<cstdio>#include<string.h>#include<cctype>#include<string>#include<cmath>#include<vector>#include<stack>#include<queue>#include<map>#include<set>using namespace std;int main(){ string str;map<string,string >cnt; while(getline(cin,str)&&str[0]!=0) { int loc=str.find(" "); cnt[str.substr(loc+1,str.size()-loc-1)]=str.substr(0,loc); } while(cin>>str) { if(cnt.count(str)) cout<<cnt[str]<<endl; else cout<<"eh"<<endl; } return 0;}
字典树:
#include<iostream>#include<sstream>#include<algorithm>#include<cstdio>#include<string.h>#include<cctype>#include<string>#include<cmath>#include<vector>#include<stack>#include<queue>#include<map>#include<set>using namespace std;typedef struct NodeType{ struct NodeType * child[26]; char word [11]; int isWord; NodeType() { memset(child,NULL,sizeof(child)); isWord=0; }} Node;void insertWord(Node *node,char *wo,char *wt){ int id; while(*wt) { id=*wt-'a'; if(node->child[id]==NULL) node->child[id]=new Node(); node=node->child[id]; wt++; } node->isWord=1; strcpy(node->word,wo);}char * searchWord(Node * node,char *wd){ char *noWord="eh"; int id; while(*wd) { id=*wd-'a'; if(node->child[id]==NULL) return noWord; node=node->child[id]; wd++; } if(node->isWord) return node->word; else return noWord;}int main(){ char cnt[40],dict[40],buf[40]; Node * node=new Node; while(gets(buf)&&buf[0]!=0) { int i=0; for(; buf[i]!=32; i++) cnt[i]=buf[i]; cnt[i]=0; int j; for(++i,j=0; buf[i]; i++,j++) dict[j]=buf[i]; dict[j]=0; insertWord(node,cnt,dict); } while(scanf("%s",cnt)!=EOF) { char *word = searchWord(node,cnt); printf("%s\n",word); } return 0;}
0 0
- poj 2503 Babelfish(字典树或着STL)
- poj 2503 Babelfish(字典树或STL水题) 解题报告(百炼2804)
- POJ 2503 Babelfish(STL、二分、字典树、哈希)
- poj 2503 Babelfish(字典树)
- poj 2503 Babelfish 字典树
- poj 2503 Babelfish(字典树)
- POJ 2503 Babelfish(字典树)
- poj-2503-Babelfish-字典树
- poj 2503 Babelfish(字典树)
- POJ 2503 - Babelfish(字典树)
- poj 2503 Babelfish 字典树
- POJ 2503-Babelfish【字典树】
- Babelfish+poj+字典树
- POJ 2503 Babelfish 字典树应用
- POJ 2503 Babelfish(字典树Trie)
- POJ - 2503 Babelfish 字典树做法
- POJ 2503 Babelfish(字典树)
- poj 2503 Babelfish(字典树)
- Maven学习之搭建私服Nexus
- Eclipse从数据库逆向生成Hibernate带注解的实体类
- 【转载】缓存淘汰算法--LRU算法
- ZOJ 3789 - Gears (并查集)
- 说说ReactiveCocoa 2
- poj 2503 Babelfish(字典树或着STL)
- PARSEC benchmark 编译
- 白盒测试中的六种覆盖方法
- 这些面试机会,你该主动放弃!
- devenv.exe - assert failure
- 设计模式——模版方法模式
- 常见的三种Web服务架构
- php下基于百度BAE的微信SDK框架
- 异步加载