Babelfish(二分)

在水洛城搬家后,面对难以理解的外语方言,利用字典进行翻译。输入包含多达100,000个字典条目,随后是一个最多100,000个单词的消息。每个字典条目由英文单词和对应的外语单词组成。消息为不超过100,000个单词的外语序列,输出为英文翻译。

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

Babelfish
Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 37238 Accepted: 15879

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
题解:此处用到了sscanf的用法,很巧妙;
代码:
 1 #include<stdio.h>
 2 #include<algorithm>
 3 #include<string.h>
 4 using namespace std;
 5 const int MAXN=100010;
 6 struct Node{
 7     char en[20],ei[20];//无语开小了。。。 
 8 };
 9 Node dt[MAXN];
10 int cmp(Node a,Node b){
11     return strcmp(a.ei,b.ei)<0;
12 }
13 int erfen(char *x,int l,int r){
14     while(l<=r){
15         int mid=(l+r)>>1;
16         if(!strcmp(dt[mid].ei,x))return mid;
17         if(strcmp(dt[mid].ei,x)>0)r=mid-1;
18         else l=mid+1;
19     }
20     return -1;
21 }
22 int main(){
23     int dm=0;
24     char str[50];
25     Node a;
26     while(gets(str)){
27         if(str[0]=='\0')break;
28             sscanf(str,"%s%s",a.en,a.ei);//这里很巧妙。。。 
29             dt[dm++]=a;
30             }
31             sort(dt,dt+dm,cmp);
32             while(~scanf("%s",str)){
33             int t=erfen(str,0,dm-1);
34             if(t==-1)puts("eh");
35             else printf("%s\n",dt[t].en);
36             }
37     return 0;
38 }

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值