Babelfish 字典树 查询O(1)

Problem 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 ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay
 

 

Sample Output
cat eh loops
***************************************************************************************************************************
字典树,无技巧
***************************************************************************************************************************
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
class nodea//建字典树的的类
{
  public:
    int id;
    nodea*p[27];
    nodea()
    {
        int it;
        id=-1;
        for(it=0;it<=26;it++)
          p[it]=NULL;
    }
};
nodea *root;
int ans;
int n,m;
char str1[100001][11];
char str2[100001][11];
int get_ans(char *s)//字典树的编码
{
    nodea *r=root;
    int m=strlen(s);
    for(int it=0;it<m;it++)
    {
        if(r->p[s[it]-'a']==NULL)//分支要尽可能的少
          r->p[s[it]-'a']=new nodea();
        r=r->p[s[it]-'a'];
    }
    if(r->id==-1)
    {
        r->id=ans;
        ans++;
    }
    return r->id;
}
int main()
{
    char str3[100001];
    int i,j,k,is,js;
    i=0;
    ans=0;
    root=new nodea();
    while(gets(str3))
    {
        if(strlen(str3)==0)
            break;
        j=0;
        while(str3[j]!=' ')
        {
            str1[i][j]=str3[j];
            j++;
        }
        str1[i][j]='\0';
        j++;
        k=0;
        while(str3[j]!='\0')
         {
             str2[i][k]=str3[j];
             k++;
             j++;
         }
        str2[i][j]='\0';
        int st=get_ans(str2[i]);
        i++;

    }
    n=ans;
   //for(j=0;j<ans;j++)
    //printf("%s%s",str1[j],str2[j]);
   while(gets(str3))
   {
       if(strlen(str3)==0)
         break;
       //for(i=0;i<strlen(str3);i++)
        //str4[i]=str3[i]-'a';
       k=get_ans(str3);
        if(k>=n)
        {
            printf("eh\n");
            continue;
        }
       printf("%s\n",str1[k]);//查询O(1);
   }
   return 0;
}

 

转载于:https://www.cnblogs.com/sdau--codeants/p/3387709.html

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值