POJ 2503 (tire)

最新推荐文章于 2021-11-09 00:34:21 发布

mad_lpx

最新推荐文章于 2021-11-09 00:34:21 发布

阅读量520

点赞数

分类专栏： ACM之路文章标签： dictionary struct each null build input

本文链接：https://blog.csdn.net/mad_lpx/article/details/7464327

版权

ACM之路专栏收录该内容

40 篇文章 1 订阅

订阅专栏

Babelfish

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 23185		Accepted: 9926

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".

很简单的TIRE，也可以用HASH神马的

#include<stdio.h>
#include<string.h>

#define clear(a,b) memset(a,b,sizeof(a))
#define kind 26
#define maxn 200010
#define maxn2 12

char str[maxn][maxn2] = {"eh"};

struct node{
  int xo;
  struct node *next[26];
  node(){
    xo = 0;
    clear(next,NULL);
    }
} *root;

void build(struct node *T,char s[],int k)
{
  int i = 0;
  struct node *tmp = T;
  while(s[i]){
    if (tmp->next[s[i]-'a'] == NULL) tmp->next[s[i]-'a'] = new node();
    tmp = tmp->next[s[i]-'a'];
    i++;
    }
  tmp->xo = k;
  return ;
}

int find(struct node *T,char s[])
{
  int i = 0;
  struct node *tmp = T;
  while(s[i]) if (tmp->next[s[i]-'a'] == NULL) return 0;else tmp = tmp->next[s[i++] - 'a'];
  return tmp->xo;
}

void work()
{
  int i = 0;
  char c,st[maxn2];
  struct node *root = new node();
  while(scanf("%s",str[++i]) != EOF) {
      scanf("%c",&c);
      if (c == '\n') printf("%s\n",str[find(root,str[i])]);
        else {scanf("%s",st);build(root,st,i);}
      }
    return ;
}

int main()
{
  work();
  return 0;
}