题意
传送门 POJ 2785
题解
枚举 A [ a ] + B [ b ] A[a]+B[b] A[a]+B[b] 的组合 A B AB AB 并排序,枚举 C [ c ] + D [ d ] C[c]+D[d] C[c]+D[d] 的组合,用 A B AB AB 二分搜索统计满足 A [ a ] + B [ b ] = − ( C [ c ] + D [ d ] ) A[a]+B[b]=-(C[c]+D[d]) A[a]+B[b]=−(C[c]+D[d]) 的组合个数。
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
typedef long long ll;
#define maxn 4005
int n;
int a[maxn], b[maxn], c[maxn], d[maxn], ab[maxn * maxn];
int main()
{
while (~scanf("%d", &n))
{
for (int i = 0; i < n; i++)
{
scanf("%d%d%d%d", a + i, b + i, c + i, d + i);
}
int sz = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
ab[sz++] = a[i] + b[j];
}
}
sort(ab, ab + sz);
ll res = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
int cd = -(c[i] + d[j]);
res += upper_bound(ab, ab + sz, cd) - lower_bound(ab, ab + sz, cd);
}
}
printf("%lld", res);
}
return 0;
}