HD2141 Can you find it? 【二分法求解】

最新推荐文章于 2022-04-30 16:14:27 发布

New灬soul

最新推荐文章于 2022-04-30 16:14:27 发布

阅读量285

点赞数

分类专栏：二分法问题

本文链接：https://blog.csdn.net/qq_29963323/article/details/47156855

版权

二分法问题专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Can you find it?

Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)
Total Submission(s): 17492 Accepted Submission(s): 4422

Problem Description

Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X.

Input

There are many cases. Every data case is described as followed: In the first line there are three integers L, N, M, in the second line there are L integers represent the sequence A, in the third line there are N integers represent the sequences B, in the forth line there are M integers represent the sequence C. In the fifth line there is an integer S represents there are S integers X to be calculated. 1<=L, N, M<=500, 1<=S<=1000. all the integers are 32-integers.

Output

For each case, firstly you have to print the case number as the form "Case d:", then for the S queries, you calculate if the formula can be satisfied or not. If satisfied, you print "YES", otherwise print "NO".

Sample Input

Sample Output

  
  
   
   Case 1:
NO
YES
NO
  
  
  
  
   
   *******************************************************************************************************
  
  
  
  
   
   *******************************************************************************************************
  
  
  
  
   
   AC代码
  
  
  
  
   
   //不能用三层for循环来解，这样容易超时，用二分法。 
#include<stdio.h>
#include<algorithm>
#include<iostream>
#define max 550
using namespace std;
int L[max],M[max],N[max],s[max*max];
int a,b,c;
int main()
{
	int k,j,x,p=1; 
	while(scanf("%d %d %d",&a,&b,&c)!=EOF)
	{
		k=0;
		for(int i=0;i<a;i++)
		scanf("%d",&L[i]);
		for(int i=0;i<b;i++)
		scanf("%d",&M[i]);
		for(int i=0;i<c;i++)
		scanf("%d",&N[i]);
		for(int i=0;i<a;i++)
		{
			for(int j=0;j<b;j++)
			{
				
				 s[k++]=L[i]+M[j];
			}
		} 
		sort(s,s+a*b);//用二分法必须是有序的一些数，所以必须排序。 
		int flag;
		scanf("%d",&k);
		//int p=1;
		printf("Case %d:\n",p++);
		while(k--)
		{
			flag=0;
		   scanf("%d",&x);
		for(int i=0;i<c;i++)
		   { 
			   if((binary_search(s,s+a*b,x-N[i]))!=0)//在数组中以二分法检索的方式查找，若在数组(要求数组元素非递减)中查找到x-N[i]元素则返回其下标，若查找不到则返回值为假。

			   {
			   	  flag=1;
			   }
		   }
		   if(flag)
		   printf("YES\n");
		   else
		   printf("NO\n");
	    }
	}
}