POJ-2785 (折半枚举+二分查找)

4 Values whose Sum is 0 - POJ 2785 - Virtual Judge

---

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

Inputcopy	Outputcopy
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	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 <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);

int a[4005], b[4005], c[4005], d[4005];
int n;
int sum[16000000];
void solve() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			sum[i * n + j] = c[i] + d[j];
		}
	}
	ll res = 0;
	sort(sum, sum + n * n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			int tmp = -(a[i] + b[j]);
			res += upper_bound(sum, sum + n * n, tmp) - lower_bound(sum, sum + n * n, tmp);
		}
	}
	printf("%lld\n", res);
}

int main() {
	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;
}