HDOJ2141Can you find it?【二分查找】

Can you find it?

Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/10000 K (Java/Others)

Total Submission(s): 16880    Accepted Submission(s): 4293

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

  
  

   
   3 3 3
1 2 3
1 2 3
1 2 3
3
1
4
10
  
  

 

Sample Output

  
  

   
   Case 1:
NO
YES
NO
  
  

 题意：给定三个数列A B C给一个数X问是否能由Ai+Bi+Ci组成

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int a[501];
int b[501];
int c[501];
int d[501*501];
bool cmp(int a,int b)
{
    return a<b;
}
int main()
{
    int N,L,M,S,X,i,j,k,t=1;
    while(scanf("%d%d%d",&L,&N,&M)!=EOF)
    {
        for(i=0;i<L;++i)scanf("%d",&a[i]);
        for(i=0;i<N;++i)scanf("%d",&b[i]);
        for(i=0;i<M;++i)scanf("%d",&c[i]);
        int n=0;
        for(i=0;i<L;++i)
        {
            for(j=0;j<N;++j)
            {
                d[n++]=a[i]+b[j];
            }
        }
        sort(c,c+M,cmp);
        sort(d,d+n,cmp);
        scanf("%d",&S);
        printf("Case %d:\n",t++);
        for(int u=0;u<S;++u)
        {
            scanf("%d",&X);
            int flag=0;
            for(i=0;i<M;++i)
            {
                int m=X-c[i];
                if(m>d[n-1])continue;
                if(m<d[0])break;
                int left=0,right=n-1;
                while(left<=right)
                {
                    int mid=(left+right)/2;
                    if(d[mid]==m)
                    {
                        printf("YES\n");
                        flag=1;
                        break;
                    }
                    if(d[mid]>m)right=mid-1;
                    else left=mid+1;
                }
                if(flag)break;
            }
            if(flag==0)
            printf("NO\n");
        }
    }
    return 0;
}