二分——4 Values whose Sum is 0

								4 Values whose Sum is 0

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

#include<cstring>
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
const int maxn = 4010;
int n;
int a[maxn],b[maxn],c[maxn],d[maxn],cd[maxn*maxn],ab[maxn*maxn];
int find(int i){
	int j;
	int cnt = 0;
	int l = 0;
	int r = n*n-1;
	while(l<=r){
		int mid = (l+r)>>1;
		if(cd[mid] == -ab[i]){
			for(j = mid-1;j>=0;j--){
				if(cd[j]==cd[mid]){
					cnt++;
				}
				else{
					break;
				}
			}
			for(j = mid + 1;j<=n*n-1;j++){
				if(cd[j]==cd[mid]){
					cnt++;
				}
				else{
					break;
				}
			}
			cnt++;
			return cnt;
			break;
		}
		else if(cd[mid] > -ab[i]){
			r = mid - 1;
		}
		else{
			l = mid+1;
		}
	}
	return 0;
}
int main(){
	int t,i,j,cnt,left,right,mid,x;
	scanf("%d",&n);
	for(i = 0;i<n;i++){
		scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
	}
	for(i = 0;i<n;i++){
		for(j = 0;j<n;j++){
			cd[i*n+j] = c[i] + d[j];
			ab[i*n+j] = a[i] + b[j];
		}
	}
	sort(cd,cd+n*n);
	cnt = 0;
	for(i = 0;i<n*n;i++){
		cnt+=find(i);
	}
	printf("%d\n",cnt);
} 

分为ab和cd 2个和数组然后再枚举二分