POJ 2503, Babelfish

最新推荐文章于 2019-07-07 16:01:00 发布

weixin_33928467

最新推荐文章于 2019-07-07 16:01:00 发布

阅读量170

点赞数 1

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/asuran/archive/2009/10/09/1579598.html

本文介绍了一种高效的字典查询算法，用于处理大型输入输出数据集，如100,000条字典条目和消息单词。通过使用散列表和特定的散列函数，该算法能快速查找并翻译外语词汇，未找到的词汇将被翻译为“eh”。文章提供了一个C++实现示例，展示了如何构建散列表以加速查询过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 12536 Accepted: 5529

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

Hint
Huge input and output,scanf and printf are recommended.

Source
Waterloo local 2001.09.22

// POJ2503.cpp : Defines the entry point for the console application.
//

#include <iostream>
using namespace std;

struct Word
{
    Word():next(0){}
    char from[12], to[12];
    Word* next;
};
inline int calcKey(char word[],int SIZE)
{
    int key = 0;
    int K = strlen(word);
    for(int j=0; j<K; ++j)
        key=((key<<2)+(((int)word[j])>>4))^(((int)word[j])<<10);
    key = key % SIZE;
    key = key < 0 ? key + SIZE : key;
    return key;
}

int main(int argc, char* argv[])
{
    const int SIZE = 100003;
    Word hash[SIZE];
    char w[25];

    while(gets(w)&& w[0] != 0)
    {
        Word* pw = new Word;
        sscanf(w,"%s %s",pw->to,pw->from);
        int key = calcKey(pw->from, SIZE);
        Word* pt = &hash[key];
        while (pt->next != NULL) pt = pt->next;
        pt->next = pw;
    }

    while(gets(w)&& w[0] != 0)
    {
        int key = calcKey(w, SIZE);
        Word* pt = &hash[key];
        bool found = false;
        while (pt->next != NULL)
        {
            pt = pt->next;
            if (strcmp(pt->from, w)==0)
            {
                found = true;
                break;
            }
        }
        if(found) printf("%s\n",pt->to);
        else printf("eh\n");
    }

    return 0;
}

转载于:https://www.cnblogs.com/asuran/archive/2009/10/09/1579598.html