zoukankan      html  css  js  c++  java
  • zoj 1109 Language of FatMouse(字典树)

    Language of FatMouse

    Time Limit: 10 Seconds      Memory Limit: 32768 KB

    We all know that FatMouse doesn't speak English. But now he has to beprepared since our nation will join WTO soon. Thanks to Turing we havecomputers to help him.

    Input Specification

    Input consists of up to 100,005 dictionary entries, followed by a blankline, followed by a message of up to 100,005 words. Each dictionaryentry is a line containing an English word, followed by a space and a FatMouse word.No FatMouse word appears more than once in thedictionary. The message is a sequence of words in the language of FatMouse,one word on each line. Each word in the input is a sequence of at most 10lowercase letters.

    Output Specification

    Output is the message translated to English, one word per line. FatMouse 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
    

    Output for Sample Input

    cat
    eh
    

    loops

    题解:建科字典树,单词插入的结尾记录该单词相应的单词的下标,查询就可以。

    #include<cstring>
    #include<algorithm>
    #include<cstdio>
    #include<iostream>
    #include<cstdlib>
    
    #define N 100020
    
    using namespace std;
    
    char s[12];
    char ans[N][12];
    
    struct Trie {
        int id;
        struct Trie *nxt[26];
        Trie() {
            id=0;
            for(int i=0; i<26; i++) {
                nxt[i]=NULL;
            }
        }
    };
    
    void Trie_Inser(Trie *p,char s[],int id) {
        int i=0;
        Trie *q=p;
        while(s[i]) {
            int nx=s[i]-'a';
            if(q->nxt[nx]==NULL) {
                q->nxt[nx]=new Trie;
            }
            i++;
            q=q->nxt[nx];
        }
        q->id=id;
    }
    
    int Trie_Serch(Trie *p,char s[]) {
        Trie *q=p;
        int i=0;
        while(s[i]) {
            int nx=s[i]-'a';
            if(q->nxt[nx]==NULL)return 0;
            q=q->nxt[nx];
            i++;
        }
        return q->id;
    }
    
    int main() {
        //freopen("test.in","r",stdin);
        Trie *p=new Trie;
        int id=1;
        char a[40];
        while(1) {
            gets(a);
            if(a[0]=='')break;
            int l=0;
            int len=strlen(a);
            int i;
            for(i=0; i<len; i++) {
                if(a[i]==' ')break;
                ans[id][l++]=a[i];
            }
            ans[id][l]='';
            l=0;
            i++;
            for(; i<len; i++) {
                s[l++]=a[i];
            }
            s[l]='';
            //printf("%s %s
    ",ans[id],s);
            Trie_Inser(p,s,id);
            id++;
        }
        while(~scanf("%s",s)) {
            id=Trie_Serch(p,s);
            if(id==0) {
                printf("eh
    ");
            } else {
                printf("%s
    ",ans[id]);
            }
        }
        return 0;
    }
    


  • 相关阅读:
    几种加密算法的java实现包括MD5、RSA、SHA256
    js 向form表单中插入数据
    HTTP的长短连接、长短轮询的区别(转载)
    try catch finally 关闭流标准的写法
    从黑格尔的正反合理论看人生的三个阶段
    《人人都是产品经理》读书笔记
    什么是PRD、MRD与BRD
    关于B/S系统中文件上传的大小限制怎么做
    如何向外行解释产品经理频繁更改需求为什么会令程序员烦恼?
    web页面开发笔记(不断更新)
  • 原文地址:https://www.cnblogs.com/wzjhoutai/p/6753194.html
Copyright © 2011-2022 走看看