HDOJ-1075 What Are You Talking About 字典树查找

最新推荐文章于 2024-05-22 20:31:44 发布

weixin_34256074

最新推荐文章于 2024-05-22 20:31:44 发布

阅读量79

点赞数

文章标签： c/c++ java

What Are You Talking About

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

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! 
  

 
/* 功能Function Description:     HDOJ-1075 字典树
  开发环境Environment:          DEV C++ 4.9.9.1
  技术特点Technique:
  版本Version:
  作者Author:                   可笑痴狂
  日期Date:                      20120810
  备注Notes:
*/


//代码一：-------杭电上这个代码有时候能提交，有时候显示  内存访问非法，不知道啥原因
//islower(ch)用以判断ch中的字母是否为小写字母，issupper(c) 判断是否为大写字母。
#include<stdio.h>
#include<string.h>
#include<malloc.h>
#include<ctype.h>

typedef struct node
{
   char s[50];
   struct node *next[26];
}node;

node memory[1000000];
int k=0;

void insert(char *b,char *a,node *T)   //用b插入字典树，并将b对应的译文a放在b的末节点中
{
   int i,len,j,id;
   node *p,*q;
   p=T;
   len=strlen(b);
   for(i=0;i<len;++i)
   {
       id=b[i]-'a';
       if(p->next[id]==NULL)
       {
       //    q=(node *)malloc(sizeof(node));
           q=&memory[k++];
           memset(q->s,'\0',sizeof(q->s));
           for(j=0;j<26;++j)
               q->next[j]=NULL;
           p->next[id]=q;
       }
       p=p->next[id];
   }
   strcpy(p->s,a);
}

int search(char *t,node *T)   //在字典树中查找t，找到的话，输出译文并返回1，否则返回0
{
   int id,i=0;
   char *p=t;
   node *q=T;
   while(islower(p[i]))
   {
       id=p[i]-'a';
       if(q->next[id]==NULL) //未找到
           return 0;
       else
       {
           q=q->next[id];
           ++i;
       }
   }
   if(strlen(q->s))      //s中不空 说明存在相应的翻译，直接输出译文
   {
       printf("%s",q->s);
       return 1;
   }
   return 0;
}

int main()
{
   int i,len;
   char a[50],b[50];
   char c[4000];
   node *T;
//    T=(node *)malloc(sizeof(node));
   T=&memory[k++];
   memset(T->s,'\0',sizeof(T->s));
   for(i=1;i<26;++i)
       T->next[i]=NULL;
   while(scanf("%s",a)&&strcmp(a,"START")==0)
   {
       while(scanf("%s",a)&&strcmp(a,"END"))
       {
           scanf("%s",b);
           insert(b,a,T);
       }
       while(scanf("%s",a)&&strcmp(a,"START")==0)
       {
           getchar();
           while(gets(c))
           {
               if(strcmp(c,"END")==0)
                   return 0;
               len=strlen(c);
               for(i=0;i<len;++i)
               {
                   if(!islower(c[i]))
                       printf("%c",c[i]);
                   else
                   {
                       if(!search(&c[i],T))
                       {
                           while(islower(c[i]))
                               printf("%c",c[i++]);
                           --i;
                       }
                       else
                       {
                           while(islower(c[i++]));
                           i-=2;
                       }
                   }
               }
               printf("\n");
           }
       }
   }
   return 0;
}

//网上的代码：
//代码一：-------字典树
#include<iostream>
#include<string>
using namespace std;
int i;
struct dictree
{
   dictree *child[26];
   char engWord[11];
   dictree()//初始化非常的有必要
   {
       for(i=0;i<26;i++)
           child[i] = NULL;
       engWord[0]='\0';
   }
};
dictree root;
void insert(char eng[],char mar[])//构建字典树
{
   dictree *now = &root;
   char *tmp = mar;
   while(*tmp)
   {
       if(now->child[*tmp-'a']==NULL)
           now->child[*tmp-'a'] = new dictree;
       now = now->child[*tmp-'a'];
       tmp++;
   }
   strcpy(now->engWord,eng);    
}

char *find(char ch[])//查找单词
{
   dictree *p = &root;
   int k=0;
   while(1)
   {
       if(ch[k]=='\0' || p->child[ch[k]-'a']==NULL)
           break;
       p = p->child[ch[k]-'a'];
       k++;
   }
   if(ch[k]=='\0' && strcmp(p->engWord,"")!=0)
       return p->engWord;
   return NULL;
}

int main()
{
   char a[11],b[11];
   scanf("%s",a);//"START"
   while(scanf("%s",a) && strcmp(a,"END")!=0 )
   {
       scanf("%s",b);
       insert(a,b);
   }
   scanf("%s",a);//"START"
   getchar();//吃回车
   char tmp[3002];
   while(1)
   {
       gets(tmp);//用这个比getline()强
       if(strcmp(tmp,"END") == 0 )
           break;
       int i,len,k=0;
       len = strlen(tmp);
       tmp[len]=' ';//多加一个' '，输出的时候注意
       tmp[++len]='\0';
       char tp[3002];
       for(i=0;i<len;i++)
       {
           if(!(tmp[i]>='a' && tmp[i]<='z'))//非小写字母
           {
               tp[k]='\0';
               char *temp = find(tp);//查找是否有对应的engWord
               if(temp)//存在这个单词
                   printf("%s",temp);
               else                                                    
                   printf("%s",tp);//可以用cout<<tp;//不可以用puts(tp);用puts有换行
               k=0;
               if(i!=len-1)//最后有一个' '是多余的
                   cout<<tmp[i];//输出非小写字母字符
           }
           else //小写字母
               tp[k++]=tmp[i];
       }
       cout<<endl;
   }
   return 0;
} 



// 代码二：---STL map
#include<iostream>
#include<string>
#include<map>
using namespace std;
map<string,string>M;
int main()
{
   string a,b;
   cin>>a;//"START"
   while(cin>>a && a!="END")
   {
       cin>>b;
       M[b] = a;
   }
   cin>>a;//"START"
   getchar();//吃回车
   char tmp[3005];
   while(1)
   {
       gets(tmp);//用这个比getline()强
       if(strcmp(tmp,"END") == 0 )
           break;
       int i,len;
       len = strlen(tmp);
       b = "";
       for(i=0;i<len;i++)
       {
           if(!(tmp[i]>='a' && tmp[i]<='z'))//非小写字母
           {
               if(M[b]!="")//存在这个单词
                   cout<<M[b];
               else
                   cout<<b;
               b="";
               cout<<tmp[i];
           }
           else //小写字母
               b+=tmp[i];
       }
       cout<<endl;
   }
   return 0;
}  
   
 

weixin_34256074

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
HDOJ-1075 What Are You Talking About 字典树查找

What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 7414 Accepted Submission(s): 2292Problem DescriptionIgnati...
复制链接

扫一扫