zoukankan      html  css  js  c++  java
  • POJ 2503 Babelfish

    Babelfish
    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
    
    题目思路;
    重点是输入,然后map一一映射就可以了,输入可以用getline(cin,a);
    下面是mapAC代码
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <queue>
    #include <cmath>
    #include <vector>
    #include <set>
    #include <map>
    #include <algorithm>
    using namespace std;
    typedef long long ll;
    int main()
    {
        map<string,string>m;
        char c[15],b[15];
        string a;
        int i;
        while(getline(cin,a))
        {
            if(a=="") break;
            int x=0,y=0;
            for(i=0;a[i]!=' ';i++)
            {
                c[y++]=a[i];
            }
            c[y++]='';
            for(i++;a[i]!='';i++)
            {
                b[x++]=a[i];
            }
            b[x++]='';
            m[b]=c;
        }
        while(scanf("%s",b)!=EOF)
        {
            if(m.find(b)!=m.end())
                cout<<m[b]<<endl;
            else printf("eh
    ");
        }
        return 0;
    }

     再来一个字典树代码
    时间:1600ms

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <queue>
    #include <cmath>
    #include <vector>
    #include <set>
    #include <map>
    #include <algorithm>
    using namespace std;
    typedef long long ll;
    struct trie
    {
        bool isend;
        char isends[20];
        trie *next[28];
        trie()
        {
            isend=false;
            isends[0]='';
            memset(next,0,sizeof(next));
        }
    };
    trie *root;
    void insert(trie *root,char *s,char *ss)
    {
        trie *p=root;
        trie *tmp;
        int len=strlen(s);
        int x;
        for(int i=0;i<len;i++)
        {
            x=s[i]-'a';
            if(p->next[x]==NULL)
            {
                tmp=new trie();
                p->next[x]=tmp;
            }
            p=p->next[x];
        }
        strcpy(p->isends,ss);
    }
    void query(trie *root,char *s)
    {
        trie *p=root;
        int x;
        for(int i=0;s[i]!='';i++)
        {
            x=s[i]-'a';
            if(p->next[x]==NULL)
            {
                printf("eh
    ");
                return;
            }
            p=p->next[x];
        }
        printf("%s
    ",p->isends);
    }
    int main()
    {
        char b[15],c[15];
        string a;
        int i=0;
        root=new trie();
        while(getline(cin,a))
        {
            if(a=="") break;
            int x=0,y=0;
            for(i=0;a[i]!=' ';i++)
            {
                c[y++]=a[i];
            }
            c[y++]='';
            for(i++;a[i]!='';i++)
            {
                b[x++]=a[i];
            }
            b[x++]='';
            insert(root,b,c);
        }
        while(scanf("%s",b)!=EOF)
        {
            query(root,b);
        }
        return 0;
    }

     再来一个输入处理,时间效率更高
    700ms

    int main()
    {
        char b[15],c[15],a;
        int i;
        root=new trie();
        while(1)
        {
            if((a=getchar())=='
    ')break;
            c[0]=a;
            i=1;
            while(1){
                if((a=getchar())==' ') break;
                c[i++]=a;
            }
            c[i]='';
            i=0;
            while(1){
                if((a=getchar())=='
    ') break;
                b[i++]=a;
            }
            b[i]='';
            insert(root,b,c);
        }
        while(scanf("%s",b)!=EOF)
        {
            query(root,b);
        }
        return 0;
    }
  • 相关阅读:
    HDU5195 线段树+拓扑
    Codeforces Round #328 (Div. 2)D. Super M 虚树直径
    HDU5489 LIS变形
    BZOJ 1787: [Ahoi2008]Meet 紧急集合 LCA
    Codeforces Round #330 (Div. 2)B. Pasha and Phone 容斥
    Codeforces Round #330 (Div. 2) D. Max and Bike 二分
    Codeforces Round #277 (Div. 2) E. LIS of Sequence DP
    Codeforces Round #277 (Div. 2) D. Valid Sets DP
    内存对齐
    mui列表跳转到详情页优化方案
  • 原文地址:https://www.cnblogs.com/shinianhuanniyijuhaojiubujian/p/7122011.html
Copyright © 2011-2022 走看看