HDU 1075 What Are You Talking About (字典树)
来源:互联网 发布:淘宝上买阅读器怎样 编辑:程序博客网 时间:2024/06/05 08:10
What Are You Talking About
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 21604 Accepted Submission(s): 7196
Problem Description
Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want to translate the history book into English. Can you help him?
Input
The problem has only one test case, the test case consists of two parts, the dictionary part and the book part. The dictionary part starts with a single line contains a string "START", this string should be ignored, then some lines follow, each line contains two strings, the first one is a word in English, the second one is the corresponding word in Martian's language. A line with a single string "END" indicates the end of the directory part, and this string should be ignored. The book part starts with a single line contains a string "START", this string should be ignored, then an article written in Martian's language. You should translate the article into English with the dictionary. If you find the word in the dictionary you should translate it and write the new word into your translation, if you can't find the word in the dictionary you do not have to translate it, and just copy the old word to your translation. Space(' '), tab('\t'), enter('\n') and all the punctuation should not be translated. A line with a single string "END" indicates the end of the book part, and that's also the end of the input. All the words are in the lowercase, and each word will contain at most 10 characters, and each line will contain at most 3000 characters.
Output
In this problem, you have to output the translation of the history book.
Sample Input
STARTfrom fiwohello difhmars riwosfearth fnnvklike fiiwjENDSTARTdifh, i'm fiwo riwosf.i fiiwj fnnvk!END
Sample Output
hello, i'm from mars.i like earth!HintHuge input, scanf is recommended.
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1800 1247 1298 1026 1072
#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;struct node{struct node *child[26];char *str;}*root;void init(){for(int i=0;i<26;i++){root->child[i]=0;}}void insert(char *c1,char *c2){struct node *cur,*newnode;int len = strlen(c2);cur = root;for(int i=0;i<len;i++){if(cur->child[c2[i]-'a']!=0){cur=cur->child[c2[i]-'a'];}else{newnode =new struct node;cur->child[c2[i]-'a']=newnode;for(int j=0;j<26;j++){newnode->child[j]=0;}newnode->str=NULL;cur=newnode;}}cur->str= new char[15];strcpy(cur->str,c1);}void puts(char *c2){int len=strlen(c2);struct node *cur;cur = root;for(int i=0;i<len;i++){if(c2[i]<'a'||c2[i]>'z'||cur->child[c2[i]-'a']==0){printf("%s",c2);return ;}else{cur=cur->child[c2[i]-'a'];}}if(cur->str!=NULL){printf("%s",cur->str);}else{printf("%s",c2);}}int main(){char c1[2100],c2[2100],temp[5100],s[20];root =new struct node ;init();scanf("%s",temp);while(scanf("%s",c1)&&strcmp(c1,"END")!=0){scanf("%s",c2);insert(c1,c2);}scanf("%s",temp);getchar();while(gets(temp) && strcmp(temp,"END")!=0) { int len = strlen(temp); int flag=0; int num=0; for(int i=0;i<len ;i++) { if(temp[i]>='a'&&temp[i]<='z') { if(flag==0) flag=1; s[num++]=temp[i];}else{if(flag){flag=0;s[num]='\0';puts(s);num=0; } printf("%c",temp[i]);}}if(flag){s[num]='\0';puts(s);}printf("\n");}return 0;}
0 0
- HDU 1075 What Are You Talking About(字典树)
- hdu 1075 What Are You Talking About (字典树)
- hdu-1075-What Are You Talking About-(字典树)
- hdu 1075 What Are You Talking About(字典树方法)
- hdu 1075 What Are You Talking About 字典树
- HDU 1075 What Are You Talking About 字典树
- hdu 1075 What Are You Talking About(字典树)
- hdu 1075 What Are You Talking About(字典树)
- hdu 1075 What Are You Talking About (字典树)
- hdu 1075 What Are You Talking About 字典树
- hdu 1075 What Are You Talking About(字典树)
- [字典树] HDU 1075 - What Are You Talking About
- hdu 1075 What Are You Talking About 字典树 trie
- hdu 1075 What Are You Talking About (字典树)
- hdu 1075 What Are You Talking About 字典树
- HDU 1075 What Are You Talking About(字典树)
- hdu 1075 What Are You Talking About(字典树)
- 【字典树】hdu 1075 What Are You Talking About
- Matlab编程与数据类型 -- 数据类型概述
- Ionic Grid栅格布局居中实例
- C10-1 单词计数
- CCF201312-3 最大的矩形(解法二)(100分)
- LEAPMotion猎户座(VR)开发~003~UI
- HDU 1075 What Are You Talking About (字典树)
- Boost C++ Libraries 遍历文件目录
- 2017年计划
- python多行字符串拼接使用小括号
- Codeforces 679C Bear and Square Grid(滑动窗口)
- library cache lock 相关的bug list
- Linux下配置vsftp的若干问题
- Struts2校验器详解
- Codeforces 685B Kay and Snowflake(树的重心)