poj 2785 4 Values whose Sum is 0（二分）

直接暴力是复杂度是n^4,可以分成两组，ab、cd各一组，先求出ab能组成的数，然后对其排序，再求cd能组成的数的同时二分ab能组成的数确定有几组能组成0。这样就把复杂

度降到了n^2*logn.

再二分找ab中有多少符合的数时巧妙的用到了upper_bound和lower_bound的差。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int n, a[4005][5], ab[4005*4005];
int main(void)
{
    while(cin >> n)
    {
        for(int i = 0; i < n; i++)
            for(int j = 0; j < 4; j++)
                scanf("%d", &a[i][j]);
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n; j++)
                ab[i*n+j] = a[i][0]+a[j][1];
        ll ans = 0;
        sort(ab, ab+n*n);
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n; j++)
            {
                int del = -(a[i][2]+a[j][3]);
                ans += upper_bound(ab, ab+n*n, del)-lower_bound(ab, ab+n*n, del);
            }
        printf("%lld\n", ans);
    }
    return 0;
}

4 Values whose Sum is 0

Time Limit: 15000MS		Memory Limit: 228000K
Total Submissions: 20371		Accepted: 6113
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

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).