杭电acm 1075What Are You Talking About(字典树)
来源:互联网 发布:vpn网络加速器 编辑:程序博客网 时间:2024/05/18 20:12
What Are You Talking About
Time Limit : 10000/5000ms (Java/Other) Memory Limit : 102400/204800K (Java/Other)
Total Submission(s) : 18 Accepted Submission(s) : 6
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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!
Hint
Huge input, scanf is recommended.
题意:
先给字典然后要我们翻译句子
想法:字典树,注意:有空串'\0'
代码:
#include<iostream>#include<algorithm>#include<stdio.h>#include<string.h>using namespace std;const int N=26;struct Trie{ int num; Trie *nx[N];};Trie *root;void init (Trie *t){ for (int j = 0; j < N; ++j) //初始化 { t->nx[j] = NULL; } t->num = -1;}void Insert (char str[],int Id)//插入单词{ Trie *p = root; int len = strlen (str); for (int i = 0; i < len; ++i) { int id = str[i] - 'a'; if (p->nx[id] == NULL) { Trie *t = new Trie; init(t); p->nx[id] = t; } p = p->nx[id]; } p->num=Id;//该结点是单词的尾}int Find(char str[])//查找前缀为str的单词数{ Trie *p = root; int cnt,len = strlen(str); for (int i = 0;i < len;++i) { int id = str[i] - 'a'; if (p->nx[id] == NULL) return -1; p = p->nx[id]; //cnt = p->num; } return p->num;}void Delete(Trie *t){ for (int i = 0;i < N;++i) { if (t->nx[i]!=NULL) Delete(t->nx[i]); } delete t;}char s1[3000010][30],s2[3000010][30];int main(){ char s[3010]; scanf("%s",s); getchar(); root = new Trie; init(root); int Id=0; while(gets(s)) { if(!strcmp(s,"END")) break; sscanf(s,"%s %s",s1[Id],s2[Id]); Insert(s2[Id],Id);Id++; } scanf("%s",s); getchar(); int kk=0; while(gets(s)) { if(!strcmp(s,"END")) break; int len=strlen(s); int i,count=0; char w[1010]; for(i=0;i<len;i++) { if(s[i]>='a'&&s[i]<='z') { w[count++]=s[i]; } else { w[count++]='\0'; if(Find(w)==-1) printf("%s",w); else printf("%s",s1[Find(w)]); printf("%c",s[i]); count=0; memset(w,0,sizeof(w)); } } printf("\n"); } return 0;}
阅读全文
0 0
- 杭电acm 1075What Are You Talking About(字典树)
- 杭电 acm 1075 What Are You Talking About
- 杭电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(字典树)
- HDOJ 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 字典树
- 响应消息的封装与转换
- 程序员,为什么写不好一份简历?
- CSU-ACM2017暑期训练16-树状数组 C
- Shell变量$#,$@,$0,$1,$2
- JAVA五种线程池的使用
- 杭电acm 1075What Are You Talking About(字典树)
- 阿里编程测验
- Webpack的配置与使用
- 3-6搭建mail服务器
- 数组(慢慢添加)
- 再见线程
- Carbide在出现低电量时,来信息不提醒
- ES1.x版本升级后filter查询被移除
- switch语句,在case中没有break时出现穿透