poj 2503 哈希 Map 字典树
来源:互联网 发布:Python中eval() 编辑:程序博客网 时间:2024/06/01 10:02
Babelfish
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 36967 Accepted: 15749
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
//16096K 2625MS#include<iostream>#include<cstdio>#include<map>#include<cstring>using namespace std;int main(){char s[100],s1[11];string ss;char c;map<string,string>Q;int num;while(gets(s)&&s[0]!='\0') //读串比读多个字符快{int len=strlen(s);int i;for( i=0;i<len;i++){if(s[i]==' '){s[i]='\0'; break;}}ss=s+i+1;Q[ss]=s;}while(~scanf("%s",s1)){if(Q[s1].size())cout<<Q[s1]<<endl;elseprintf("eh\n");}}//while(~scanf("%c",&c)) // 超时//{//if(c=='\n')//break;//num=0;//while(c!=' ')//{//s[num++]=c;//scanf("%c",&c);//}//s[num]='\0'; //够成字符串//num=0;//scanf("%c",&c); //防止上一个空格被读入////while(c!='\n')//{//ss[num++]=c;//scanf("%c",&c);//}//ss[num]='\0';//Q[ss]=s;//}
//字典树 26240K <span id="transmark"></span>735MS#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>using namespace std;char ss[100],s[100],c[100010][100];int num=0;struct node{int flag;node *next[26];}*head;node * Creat(){node *p;p=new node;p->flag=0;for(int i=0;i<26;i++)p->next[i]=NULL;return p;}int Build_Tree(){node *p=head; int len=strlen(s); for(int i=0;i<len;i++){int a=s[i]-'a';if(!p->next[a]){p->next[a]=Creat();//p->next[a]->flag=num;}p=p->next[a];}p->flag=num;}int Find(char s1[]){int len=strlen(s1);node *p=head;for(int i=0;i<len;i++){int a=s1[i]-'a';if(!p->next[a]){return 0;}p=p->next[a];}return p->flag;}int main(){num=1;head=Creat();while(gets(ss)&&ss[0]!='\0'){sscanf(ss,"%s %s",c[num],s);Build_Tree();num++;}char s1[100];while(~scanf("%s",s1)){int flag=Find(s1); //cout<<flag;if(flag)printf("%s\n",c[flag]);elseprintf("eh\n");}}
1 1
- poj 2503 哈希 Map 字典树
- POJ Babelfish 2503(map,字典树)
- poj 2503 map实现和字典树实现
- POJ 2503 Babelfish map水过,字典树????
- POJ 2503 Babelfish(人造字典map)
- POJ 2418 Hardwood Species (字典树||MAP)
- poj 2418 字典树 Map容器
- POJ 2418 Hardwood Species【字典树 / map】
- POJ 2503 Babelfish 字典树经典题 三种方法 (map,排序+二分,字典树)
- poj 2503 字典树
- POJ 2503 字典树
- poj-2503 字典树
- POJ 2503 Babelfish(map,字典树,快排+二分,hash)
- POJ 2418 Hardwood Species (字典树 || map)
- poj 2503(字典树)
- poj 2503 Babelfish(字典树)
- poj 2503 Babelfish 字典树
- poj 2503 Babelfish(字典树)
- msvcprt.lib(MSVCP90.dll) : error LNK2005:已经在libcpmtd.lib(xmutex.obj) 中定义
- Linux启动过程详解(inittab、rc.sysinit、rcX.d、rc.local)
- project facets
- 【sql】mysql left join,right join,inner join超详细用法解析
- android侧滑菜单-DrawerLayout的基本使用
- poj 2503 哈希 Map 字典树
- 无USB下如何实现PC电脑与手机无线连接
- Codeforces Round #152 (Div. 2) D. Sweets for Everyone!(二分)
- C++编译、链接涉及到的一些基本问题
- Is It A Tree?(并查集)
- MySql:eclipse连接
- git-stash
- C语言中sscanf 的详细用法
- miniwebx 基于webx设计思想的轻量级mvc框架