HDU 1075 What Are You Talking About

分析：此题目感觉出的不是很好，没有说明是输入一句输出一句，还是输入完之后再输出完。

cin与gets要区分开。

map比较耗时，但是方便。

代码一：map

#include <iostream>
#include <map>
#include <cstring>
using namespace std;

map <string,string> m;
string s1,s2;
char s[3005];

int main() 
{
	int k=0;
    cin>>s;
    while(cin>>s1,s1!="END")
    {
    	cin>>s2;
    	m[s2]= s1;
	}
	cin>>s;
	getchar();
	string a="";
	while(gets(s),strcmp(s,"END")!=0)
	{
		a="";
		int len = strlen(s);
		for(int i=0;i<len;i++)
		{
			if(islower(s[i]))     //判断是否为小写字母
			   a += s[i];            //使用string的特性可以连加
			else
			{
				if(m[a] !="")
				   cout<<m[a];
				else
				   cout<<a;
				cout<<s[i];
				a="";
			}
		}
		cout<<endl;
		
	}
	return 0;
}

代码二：trie

#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;

string s1,s2;
char s[3005];

struct trie
{
	trie *next[26];
	int v;
	string ss;
	trie()
	{
		v=1;
		memset(next,NULL,sizeof(next));
	}
};

trie *root = new trie();

void creat(string s1,string s2)
{
	trie *p = root;
	
	for(int i=0;s2[i];i++)
	{
		int id = s2[i] - 'a';
		if(p->next[id] == NULL)
		{
			p->next[id] = new trie();
		}
		p = p->next[id];
	}
	p->ss = s1;
	p->v = -1;
	
}

trie *find(string a)
{
	int i;
	trie *p;
	for(p = root,i=0;a[i];i++)
	{
		int id = a[i] - 'a';
		if(p->next[id] != NULL)
		{
			p = p->next[id];
		}
		else
		    return NULL;
	}
	if(p->v == -1)             //此处还要判断，不判断确实WA 
	     return p;
	else
	     return NULL;
}

void ref(trie *p)
{
	if(p == NULL)
	   return ;
	for(int i=0;i<26;i++)
	{
		if(p->next[i] != NULL)
	    {
		 	ref(p->next[i]);
		    
		}  
	}
	free(p);
} 

int main() 
{
	int k=0;
    cin>>s;
    while(cin>>s1,s1!="END")
    {
    	cin>>s2;
    	creat(s1,s2);
	}
	cin>>s;
	getchar();
	string a;
	while(gets(s),strcmp(s,"END"))
	{
		a="";
		int len = strlen(s);
		for(int i=0;i<len;i++)
		{
			if(islower(s[i]))
			   a += s[i];
			else
			{
				trie *pp = find(a);
				if(pp)
				   cout<<pp->ss;
				else
				   cout<<a;
				cout<<s[i];
				a="";
			}
		}
		cout<<endl;
	}
	ref(root);
	return 0;
}

What Are You Talking About

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/204800 K (Java/Others)
Total Submission(s): 15698    Accepted Submission(s): 5046

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

  
  

   
   START
from fiwo
hello difh
mars riwosf
earth fnnvk
like fiiwj
END
START
difh, i'm fiwo riwosf.
i fiiwj fnnvk!
END
  
  

 

Sample Output

  
  

   
   hello, i'm from mars.
i like earth!


   
   

    
    

     
     Hint
    
    
Huge input, scanf is recommended.

   
   
   
    
  
  

 

Author

Ignatius.L