POJ 2785 4 Values whose Sum is 0(二分法)

4 Values whose Sum is 0
Time Limit: 15000MS     Memory Limit: 228000K
Total Submissions: 20385        Accepted: 6116
Case Time Limit: 5000MS
Description
The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b + c + d = 0 . In the following, we assume that all lists have the same size n .
Input
The first line of the input file contains the size of the lists n (this value can be as large as 4000). We then have n lines containing four integer values (with absolute value as large as 228 ) that belong respectively to A, B, C and D .
Output
For each input file, your program has to write the number quadruplets whose sum is zero.
Sample Input
6
-45 22 42 -16
-41 -27 56 30
-36 53 -37 77
-36 30 -75 -46
26 -38 -10 62
-32 -54 -6 45
Sample Output
5
Hint
Sample Explanation: Indeed, the sum of the five following quadruplets is zero: (-45, -27, 42, 30), (26, 30, -10, -46), (-32, 22, 56, -46),(-32, 30, -75, 77), (-32, -54, 56, 30).

四个数组求其中a+b+c+d=0的数量(可重复),四组可以两两相加分成两组，在进行二分搜索即可，刚开始用的是
binary_search,wa了，没注意到重复相同的值，所以这里用lower_bound和upper_lound可以求出区间
所有符合的值，水水水。

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<ctime>
#include<string>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<cstdio>
#include<limits.h>
#define MOD 1000000007
#define fir first
#define sec second
#define fin freopen("/home/ostreambaba/文档/input.txt", "r", stdin)
#define fout freopen("/home/ostreambaba/文档/output.txt", "w", stdout)
#define mes(x, m) memset(x, m, sizeof(x))
#define Pii pair<int, int>
#define Pll pair<ll, ll>
#define INF 1e9+7
#define Pi 4.0*atan(1.0)

#define lowbit(x) (x&(-x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-12;
const int maxn = 4010;
using namespace std;

inline int read(){
    int x(0),f(1);
    char ch=getchar();
    while (ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int A[maxn],B[maxn],C[maxn],D[maxn],CD[maxn*maxn];
int main()
{
    int N;
    while(~scanf("%d",&N)){
        for(int i=0;i<N;++i){
            A[i]=read(),B[i]=read(),C[i]=read(),D[i]=read();
        }
        for(int i=0;i<N;++i){
            for(int j=0;j<N;++j){
                CD[i*N+j]=C[i]+D[j];
            }
        }
        ll res=0;
        sort(CD,CD+N*N);
        for(int i=0;i<N;++i){
            for(int j=0;j<N;++j){
                int re=-(A[i]+B[j]);
                res+=upper_bound(CD,CD+N*N,re)-lower_bound(CD,CD+N*N,re);
            }
        }
        printf("%lld\n",res);
    }
    return 0;
}