hdu 2141 Can you find it? 二分查找

Can you find it?

 

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

 

 

 

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

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int A[505] , B[505] , C[505] ;
int AB[250005] ;
int X , L , N , M;
int cmp( const void *a , const void *b )
{
    return *(int *)a - *(int *)b ;
}
int find ( int min , int max , int x )
{
    while( min <= max )
    {
        int mid = ( min + max )/2 ;
        if( AB[mid] == x ) return 1 ;
        if( AB[mid] > x ) max = mid - 1 ;
        if( AB[mid] < x ) min = mid + 1 ;
    }
    return 0 ;
}
int main ( )
{
    int cas = 1;
    while( scanf("%d%d%d" , &L , &N , &M ) != EOF )
    {
        for( int i = 0 ; i < L ; i ++ )
          scanf("%d" , &A[i] );
        for( int i = 0 ; i < N ; i++ )
          scanf("%d" , &B[i] ) ;
        for( int i = 0 ; i < M ; i++ )
          scanf("%d" , &C[i] ) ;
        int k = 0 ;
        for( int i = 0 ; i < L ; i++ )
           for( int j = 0 ; j < N ; j++ )
              AB[k++] = A[i] + B[j] ;
        qsort( AB , k , sizeof( AB[0] ), cmp ) ;
        printf("Case %d:\n" , cas++ ) ;
        int n ;
        scanf("%d" , &n ) ;
        while( n-- && scanf( "%d" , &X ) )
        {
            int flag = 0 ;
            for( int i = 0 ; i < M ; i++ )
             {
               if( find ( 0 , k-1, X-C[i] ) )
               {
                   flag = 1 ; break ;
               }
             }
             if( flag ) puts( "YES");
             else puts("NO");
        }
    }
    return 0 ;
}