Can you find it?
Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 12626 Accepted Submission(s): 3262
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
Author
wangye
Source
题意:给你三个数字组,A,B,C,再给你一个数X,问是否能在A,B,C中分别找到一个数A[i],B[j],C[k],使得A[i]+B[j]+C[k]=X
二分解题思路:
如果先从前两个数组中找出两个数,有双重for 循环一定会超时。
所以,先将前两个数组的各个元素相加得到数组sum[],在sum[]数组中查找。如果题目给定的和是x,那么在sum[]数组中查找x-c[i],找到返回1,找不到返回0.