POJ 2785 4 Values whose Sum is 0【双向搜索/折半枚举】

4 Values whose Sum is 0

Time Limit: 15000MS		Memory Limit: 228000K
Total Submissions: 21935		Accepted: 6642
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 2 ²⁸ ) 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

效率：2*n^2*log2(n^2)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define ms(a,b)  memset(a,b,sizeof(a))
const int M=1e4+10;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
int i,j,k,n,m;
int A[M],B[M],C[M],D[M];
int cd[M*M];

void solve()
{
    for(int i=0;i<n;i++)
    for(int j=0;j<n;j++){
        cd[i*n+j]=C[i]+D[j];
    }
    sort(cd,cd+n*n);
    ll res=0;
    for(int i=0;i<n;i++)
    for(int j=0;j<n;j++){
        int kk=-(A[i]+B[j]);
        res+=upper_bound(cd,cd+n*n,kk)-lower_bound(cd,cd+n*n,kk);
    }
    printf("%lld\n",res);
}

int main()
{
    while(~scanf("%d",&n)){
        for(int i=0;i<n;i++){
            scanf("%d%d%d%d",&A[i],&B[i],&C[i],&D[i]);
        }
       solve();
    }
    return 0;
}