HDU2141

Can you find it?

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

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

暴力枚举，O(n^3)爆炸

枚举前两个数，二分第三个O(n^2logn)

貌似也可能爆炸

先处理前两个数字的和O(n^2)

排序，之后枚举第三个数，

二分后两个数的和O(nlogn)

故复杂度为O(n^2)可以过数据

#include
#include
#include
#include
using namespace std;


int main()
{
    int i,j;
    int Case=1;
    int l,n,m;
    //freopen("in.txt","r",stdin);
    while(scanf("%d%d%d",&l,&n,&m)!=EOF)
    {
        long long k=0;
        int a[l],b[n],c[m];
        long long ab[l*n+5];
        for(i=0;i