题意:给4个数组,问有多少种组合可以使得a + b + c + d = 0。
思路:预处理A + B,然后每次算C + D求匹配的A +B的个数。 O(n^2 log n)。
#pragma warning(disable:4996)
#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 4e3, MOD = 1e9 + 7;
int n, m;
int a[N], b[N], c[N], d[N], ab[N*N], cd[N*N];
int ans;
int main() {
while (scanf("%d", &n) != EOF) {
ans = 0;
for (int i = 0; i < n; i++) scanf("%d%d%d%d", &a[i], &b[i], &c[i], &d[i]);
int tot = 0;
for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) ab[tot++] = a[i] + b[j];
sort(ab, ab + tot);
for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {
int x = c[i] + d[j];
x = -x;
int l = lower_bound(ab, ab + tot, x) - ab, r = upper_bound(ab, ab + tot, x) - ab;
if (ab[l] != x) continue;
ans += r - l;
}
printf("%d\n", ans);
}
return 0;
}