B

最新推荐文章于 2024-12-19 14:29:46 发布

原创最新推荐文章于 2024-12-19 14:29:46 发布 · 321 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

二分贪心练习专栏收录该内容

18 篇文章

订阅专栏

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.

题意分析

类似于字典，输入一个单词和它对应的单词，输入单词输出它所对应的单词

解题思路

我们可以用一个结构体的数组来表示这个字典，然后搜索这个字典，并输出对应单词，这个题缩减时间的方式就是利用二分，从中间向两边找，大的话就缩小，小的话放大，搜索结果还是比较快的

源代码

#include<iostream>
#include<string.h>
#include<algorithm>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
struct A
{

char a[11],b[11];
}s[100001];
bool cmp(A x,A y)
{

return strcmp(x.b,y.b)<0;
}
int main()
{

int i=0,min,max,mid,k;
   char c[11],d[11],e[11];
   string n;
   while(gets(c))
   {
     if(c[0]=='\0')break;
sscanf(c,"%s%s",s[i].a,s[i].b);
++i;
   }
   sort(s,s+i,cmp);
   while(scanf("%s",c))
   { n=c;
     k=1;
     min=0;
    max=i-1;
     while(min<=max)
     {
mid=(min+max)/2;
     if(n==s[mid].b)
     {
printf("%s\n",s[mid].a);
       k=0;
       break;
}
else if(n>s[mid].b)

min=mid+1;
else

max=mid-1;
}
if(k)

printf("%s\n","eh");
}
}