九度OJ 08浙大真题之《魔咒词典》

最新推荐文章于 2019-03-01 16:56:26 发布

雨露咖啡

最新推荐文章于 2019-03-01 16:56:26 发布

阅读量728

点赞数 2

分类专栏：漫漫机试路我一个月走完文章标签：二分查找

本文链接：https://blog.csdn.net/xln0539xln/article/details/8651321

版权

漫漫机试路我一个月走完专栏收录该内容

55 篇文章 0 订阅

订阅专栏

题目地址：http://ac.jobdu.com/problem.php?pid=1029

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MAXS 100002
typedef struct E{
	char name[22];
	char op[82];
}E;
E dict1[MAXS],dict2[MAXS];
int cmp1(const void *a,const void *b)
{
	E *aa=(E *)a,*bb=(E *)b;
	return strcmp(aa->name,bb->name);
}
int cmp2(const void *a,const void *b)
{
	E *aa=(E *)a,*bb=(E *)b;
	return strcmp(aa->op,bb->op);
}
int suc,flag;
int main()
{
	int N,l,count,i,j,k,mid,temp;
	char now[105];
	for(i=1;i<=MAXS;i++)
	{
		gets(now);
		l=strlen(now);
		while(now[l]=='\0'||now[l]=='\n')l--;
		now[++l]='\0';
		if(now[0]=='@')break;
		for(j=0;now[j]!=']';j++);
		now[++j]='\0';
		strcpy(dict1[i].name,now);
		strcpy(dict1[i].op,now+j+1);
		dict2[i]=dict1[i];
	}
	for(count=i+1;dict1[count].name[0]=='\0';count--);
	qsort(dict1,++count,sizeof(dict1[0]),cmp1);
	qsort(dict2,count,sizeof(dict2[0]),cmp2);
	scanf("%d",&N);getchar();
	while(N--)
	{
		suc=flag=0;
		gets(now);
		if(now[0]=='[')
		{
			i=1;j=count-1;
			while(i<=j)
			{
				mid=(i+j)>>1;
				if((temp=strcmp(now,dict1[mid].name))==0)
				{
					suc=mid;
					flag=1;
					break;
				}
				if(temp>0)i=mid+1;
				else j=mid-1;
			}
			if(flag)puts(dict1[suc].op);
			else puts("what?");
		}
		else 
		{
			i=1;j=count-1;
			while(i<=j)
			{
				mid=(i+j)>>1;
				if((temp=strcmp(now,dict2[mid].op))==0)
				{
					strcpy(now,dict2[mid].name);
					l=strlen(now)-1;
					for(k=1;k<l;k++)now[k-1]=now[k];
					now[--k]='\0';
					suc=mid;
					flag=1;
					break;
				}
				if(temp>0)i=mid+1;
				else j=mid-1;
			}
			if(flag)puts(now);
			else puts("what?");
		}
	}
	return 0;
}