-
Notifications
You must be signed in to change notification settings - Fork 1
/
07453.cpp
45 lines (40 loc) · 917 Bytes
/
07453.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void solve(void) {
int n; cin >> n;
vector<int> a(n), b(n), c(n), d(n);
for (int i=0; i<n; i++) cin >> a[i] >> b[i] >> c[i] >> d[i];
vector<int> ab(n*n), cd(n*n);
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
ab[i*n+j] = a[i] + b[j];
cd[i*n+j] = c[i] + d[j];
}
}
sort(ab.begin(), ab.end());
sort(cd.begin(), cd.end());
long long ans = 0;
for (int l=0, r=n*n-1; l<n*n && r>=0; ) {
int sum = ab[l] + cd[r];
if (sum == 0) {
long long p = 1, q = 1;
l++; r--;
while (l < n*n && ab[l] == ab[l-1]) { l++; p++; }
while (r >= 0 && cd[r] == cd[r+1]) { r--; q++; }
ans += p * q;
} else if (sum < 0) {
l++;
} else {
r--;
}
}
cout << ans;
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}