HDU 2141 Can you find it? [二分]

Can you find it?

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.

---

你以为我是因为被$world final$打击到了而在做水题吗？

没错我就是在做水题.........mhy12345课件上的.....

每个询问枚举$A$然后二分$B+C$

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=,M=N*N;
inline int read(){
    char c=getchar();int x=,f=;
    while(c<''||c>''){if(c=='-')f=-; c=getchar();}
    while(c>=''&&c<=''){x=x*+c-''; c=getchar();}
    return x*f;
}
int a[N],b[N],c[N];
int w[M],n;
int Bin(int v){//printf("Bin %d\n",v);
    int l=,r=n;
    while(l<=r){
        int mid=(l+r)>>;//printf("%d %d %d  %d %d\n",l,r,mid,w[mid],v);
        if(w[mid]==v) return mid;
        else if(v<w[mid]) r=mid-;
        else l=mid+;
    }
    return ;
}
int main(){
    freopen("in","r",stdin);
    int cas=;
    while(scanf("%d%d%d",a,b,c)!=EOF){
        printf("Case %d:\n",++cas);
        for(int i=;i<=(*a);i++) a[i]=read();
        for(int i=;i<=(*b);i++) b[i]=read();
        for(int i=;i<=(*c);i++) c[i]=read();
        n=;
        for(int i=;i<=(*b);i++)
            for(int j=;j<=(*c);j++) w[++n]=b[i]+c[j];
        sort(w+,w++n);
        int Q=read();
        while(Q--){
            int x=read(),flag=;
            for(int i=;i<=(*a);i++) if(Bin(x-a[i])) {flag=;break;}
            if(flag) puts("YES");
            else puts("NO");
        }
    }
}