如果使用最暴力的方法,那么时间复杂度是500*500*500*1000=1.25e11>>3*3*10e8.所以肯定超时了,如果使用二分的方法,时间复杂度为500*500*log(2)500*1000≈1.3e9>9*10e8。还是会超时,但是如果现将前两个数组两两相加的结果存在一个新数组并排好序后使用二分,时间复杂度为500*500+2*log(2)500+1000*500*2*log(2)500≈6e6,所以这个方案可行。
代码如下:
#include<stdio.h>
#include<algorithm>
using namespace std;
long long a[600], b[600], c[600],d[300000];
int main(){
int k = 1,l,n,m,s;
long long x;
while (scanf("%d%d%d", &l, &n, &m) != EOF){
for (int i = 0; i < l; i++)scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)scanf("%lld", &b[i]);
for (int i = 0; i < m; i++)scanf("%lld", &c[i]);
for(int i=0;i<l;i++){
for(int j=0;j<n;j++){
d[i*n+j]=a[i]+b[j];
}
}
sort(d,d+l*n);
sort(c, c + m);
scanf("%d", &s);
printf("%s%d%c\n", "Case ", k, ':');
while(s--){
scanf("%lld", &x);
if ((d[0] + c[0]) > x || (d[l*n-1] + c[m - 1]) < x)
printf("%s\n", "NO");
else {
long long high=l*n-1, low=0, mid=(high+low)/2;
bool boo = false;
for (int j = 0; j < m;j++){
while (high >= low){
mid = (low + high) / 2;
if ((c[j] + d[mid]) == x){
boo = true;
break;
}
if ((c[j] + d[mid]) > x)high = mid - 1;
else low = mid + 1;
}
high = l*n - 1; low = 0; mid = (high + low) / 2;
if(boo)break;
}
if (boo)printf("%s\n", "YES");
else printf("%s\n", "NO");
}
}
k++;
}
return 0;
}