UVa 10282 - Babelfish

最新推荐文章于 2016-06-17 07:22:00 发布

cugfjp

最新推荐文章于 2016-06-17 07:22:00 发布

阅读量403

点赞数

分类专栏：算法文章标签： UVa

本文链接：https://blog.csdn.net/cugfjp/article/details/8962285

版权

算法专栏收录该内容

154 篇文章 0 订阅

订阅专栏

/*
hash
*/
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
const int DICT = 100010;
const int WORD = 12;
char eng[DICT][WORD];
char lan[DICT][WORD];
int entry;

const int MAX_HASH = 1000003;
int head[MAX_HASH], next[MAX_HASH];
// BKDR Hash Function
unsigned int BKDRHash(char *str)
{
    unsigned int seed = 31; // 31 131 1313 13131 131313 etc..
    unsigned int hash = 0;

    while (*str)
    {
        hash = hash * seed + (*str++);
    }
    return (hash % MAX_HASH);
}

void init()
{
    memset(head, 0, sizeof(head));
}

int try_to_insert(int s)
{
    unsigned int h = BKDRHash(lan[s]);
    int u = head[h];
    while(u) {
        if(strcmp(lan[u], lan[s]) == 0) return 0;
        u = next[u];
    }
    next[s] = head[h];
    head[h] = s;
    return 1;
}

int try_to_find(char *s)
{
    unsigned int h = BKDRHash(s);
    int u = head[h];
    while(u) {
        if(strcmp(lan[u], s) == 0) return u;
        u = next[u];
    }
    return -1;
}

int main(){
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    #endif
    entry = 1;
    char buff[30];
    init();
    int msg = 0;
    while(gets(buff)) {
        if(buff[0] == '\0') {msg = 1; continue;}
        if(msg) {
            int ret = try_to_find(buff);
            if(ret == -1) printf("eh\n");
            else printf("%s\n", eng[ret]);
        } else {
            char *p = buff;
            sscanf(p, "%s", eng[entry]);
            p = strchr(buff, ' ');
            sscanf(p, "%s", lan[entry]);
            try_to_insert(entry++);
        }
    }
    return 0;
}