poj2785 折半枚举 双向查找

4 Values whose Sum is 0

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

题意：n组有a,b,c,d四个元素的数据，每组取出一个，使和为0，求组合数。

解法一：枚举c[i]+d[j]，然后对于a[i]+b[j]的每个组合，查找在c[i]+d[j]中的匹配次数。

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;

#define INF 0x3f3f3f3f
#define MAX 100
typedef long long ll;
int n;
int a[4005],b[4005],c[4005],d[4005];
int y[16000005];

int main(int argc, char const *argv[])
{
	while(scanf("%d",&n)!=EOF) {
		for (int i = 0; i < n; ++i) scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
		for (int i = 0; i < n; ++i)
			for (int j = 0; j < n; ++j)
				y[i*n+j] = c[i]+d[j];
		sort(y,y+n*n);
		ll sum = 0;
		for (int i = 0; i < n; ++i){
			for (int j = 0; j < n; ++j){
				int tmp = -a[i]-b[j];
				sum += upper_bound(y,y+n*n,tmp)-lower_bound(y,y+n*n,tmp);
			}
		}
		printf("%lld\n", sum);	
	}
}

解法二：一的改进，枚举y=c[i]+d[j]和z=a[i]+b[j]然后在数组y中二分查找z的每个值。

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;

typedef long long ll;
int n;
int a[4005],b[4005],c[4005],d[4005];
int y[16000005];
int z[16000005];

int main(int argc, char const *argv[])
{
	scanf("%d",&n);
	for (int i = 0; i < n; ++i) scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
	for (int i = 0; i < n; ++i){
		for (int j = 0; j < n; ++j){
			y[i*n+j] = c[i]+d[j];
			z[i*n+j] = -a[i]-b[j];
		}
	}
	sort(y,y+n*n);
	sort(z,z+n*n);
	ll sum = 0;
	for (int i = 0; i < n*n; ++i)
		sum += upper_bound(y,y+n*n,z[i])-lower_bound(y,y+n*n,z[i]);
	printf("%lld\n", sum);
}