poj2785（二分）

4 Values whose Sum is 0

Time Limit: 15000MS		Memory Limit: 228000K
Total Submissions: 31340		Accepted: 9568
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).

Source

Southwestern Europe 2005

类似：https://blog.csdn.net/xianpingping/article/details/86744008

将n4通过二分，简化成n2.

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxx=4000*4000+100;
const int maxn=4000+100;
LL a[maxn],b[maxn],c[maxn],d[maxn];
LL sum[maxx];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%lld%lld%lld%lld",&a[i],&b[i],&c[i],&d[i]);
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            sum[++cnt]=a[i]+b[j];
        }
    }
    sort(sum+1,sum+1+cnt);
    LL num;
    LL ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
           num=c[i]+d[j];
           ans+=upper_bound(sum+1,sum+1+cnt,-num)-lower_bound(sum+1,sum+1+cnt,-num);
        }
    }
    printf("%lld\n",ans);
    return 0;
}