POJ_2503 Babelfish解题报告.

最新推荐文章于 2024-09-21 14:48:47 发布

Raystrider

最新推荐文章于 2024-09-21 14:48:47 发布

阅读量565

点赞数 1

分类专栏： Hash&&二分文章标签： dictionary each input 算法 null struct

本文链接：https://blog.csdn.net/May_heyikai/article/details/7375866

版权

Hash&&二分专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Babelfish

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 22699		Accepted: 9742

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.

题目连接： http://poj.org/problem?id=2503

算法类型：qsort&二分

解题思路;先把字典储存下来，再进行字典序排序，在进行二分查找。

算法实现：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
# define MAX 100003
typedef struct dictionary    //用来储存字典的结构体；
{
	char f[20];
	char n[20];
}D;
D dic[MAX];
int cmp(const void *_p,const void *_q)/* 按照单词的字典序升序排序 */     //qsort字符串排序；
{
    D *q = (D *)_q;
    D *p = (D *)_p;
	return strcmp(p->n,q->n);
}
int main()
{
	char word[30];
	int i=0;
	while(gets(word)!=NULL)
	{
		if(word[0]=='\0')
			break;
		sscanf(word,"%s%s",dic[i].f,dic[i].n);    //用sscanf读入；
		i++;
	}
	qsort(dic,i,sizeof(dic[0]),cmp);
	while(gets(word)!=NULL)
	{
	  int low,mid,high;
	  low=0,high=i;
	  while(low<high)     //二分查找；
	  {
		  mid=(low+high)/2;
		  if(strcmp(dic[mid].n,word)==0)
		  {
			  printf("%s\n",dic[mid].f);
			  break;
		  }
		  if(strcmp(dic[mid].n,word)>0)
		  {
             high=mid;
		  }
		  else
		  {         
               low=mid+1;
		  }
	  }
	  if(low>=high)
	  {
		   printf( "eh\n");
	  }
	}
	return 0;
}