杭电2141Can you find it?

Can you find it?

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

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 31 2 31 2 31 2 331410

 

Sample Output

Case 1:NOYESNO

 

Author

wangye

 

Source

HDU 2007-11 Programming Contest 

先把前两个数组元素对应加起来储存在sum数组中，然后在判断是否存在sum[i]==s-c[j]

#include<stdio.h>
#include<algorithm>
using namespace std;
int l,n,m,l1;
int a[550],b[550],c[550];
int sum[550*550];
int judge(int x)
{
int right,left,mid;
left=1;
right=l1-1;
while(left<=right)
{
mid=(left+right)/2;
if(sum[mid]>x)
right=mid-1;
else if(sum[mid]<x)
left=mid+1;
else
return 1;
}
return 0;
}
int main()
{
int i,j,k,s,x,t=1;
while(~scanf("%d%d%d",&l,&n,&m))
{
for(i=1;i<=l;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
scanf("%d",&b[i]);
for(i=1;i<=m;i++)
scanf("%d",&c[i]);
l1=1;
for(i=1;i<=l;i++)
for(j=1;j<=n;j++)
sum[l1++]=a[i]+b[j];
sort(sum+1,sum+l1);
printf("Case %d:\n",t++);
scanf("%d",&s);
while(s--)
{
scanf("%d",&x);
for(i=1;i<=m;i++)
{
  if(judge(x-c[i]))
  {
  printf("YES\n");
  break;
  }
}
if(i==m+1)
printf("NO\n");
}
}
return 0;
}