(HDU - 2141)Can you find it?

(HDU - 2141)Can you find it?

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

Total Submission(s): 31709 Accepted Submission(s): 7901

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三个序列中任选一个数，问能否使$ai+bj+ck=x$。

思路：赤裸裸的二分。先预处理出前两个集合的和sum，再去sum数组中二分查找$x-ck$。

#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn=505;
int a[maxn],b[maxn],c[maxn];
int sum[maxn*maxn];
int l,n,m,k;

bool bs(int x)
{
    int lo=0,hi=k-1,mid;
    while(lo<=hi)
    {
        mid=(lo+hi)>>1;
        if(sum[mid]>x) hi=mid-1;
        else if(sum[mid]<x) lo=mid+1;
        else return true; 
    }
    return false;
}

int main()
{
    int kase=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);
        k=0;
        for(int i=0;i<l;i++)
            for(int j=0;j<n;j++)
                sum[k++]=a[i]+b[j];
        sort(sum,sum+k);
        int s,x;
        scanf("%d",&s);
        printf("Case %d:\n",kase++);
        while(s--)
        {
            bool flag=false;
            scanf("%d",&x);
            for(int i=0;i<m;i++)
                if(bs(x-c[i]))
                {
                    flag=true;
                    printf("YES\n");
                    break;
                }
            if(!flag) printf("NO\n");
        }
    }
    return 0;
}