#include <bits/stdc++.h>
//~ #include "grader.cpp"
using namespace std;
const int N = 100001;
int n, wr[N], wc[N], mod = 1e9;
set <int> r[N], c[N];
vector <pair <int, int> > a;
map <pair <int, int>, int> mpr, mpc;
int cntr, cntc, ans;
void addr(int x, int y){
r[x].insert(y);
r[y].insert(x);
}
void addc(int x, int y){
c[x].insert(y);
c[y].insert(x);
}
void setr(int row, int col1, int col2){
int id = cntr++;
wr[id] = col2 - col1 + 1;
for(int col = col1 ; col <= col2 ; col++){
if(mpr.find(make_pair(row - 1, col)) != mpr.end()){
addr(id, mpr[make_pair(row - 1, col)]);
}
mpr[make_pair(row, col)] = id;
}
}
void setc(int col, int row1, int row2){
int id = cntc++;
wc[id] = row2 - row1 + 1;
for(int row = row1 ; row <= row2 ; row++){
if(mpc.find(make_pair(row, col - 1)) != mpc.end()){
addc(id, mpc[make_pair(row, col - 1)]);
}
mpc[make_pair(row, col)] = id;
}
}
void gor(int l, int r){
for(int i = l ; i < r ; i++){
int j = i;
while(j + 1 < r && a[j + 1].second == a[j].second + 1) j++;
setr(a[i].first, a[i].second, a[j].second);
i = j;
}
}
void goc(int l, int r){
for(int i = l ; i < r ; i++){
int j = i;
while(j + 1 < r && a[j + 1].first == a[j].first + 1) j++;
setc(a[i].second, a[i].first, a[j].first);
i = j;
}
}
void dfsr(int node, int pnode){
for(auto &i : r[node]){
if(i == pnode) continue;
dfsr(i, node);
ans = (ans + 1LL * wr[i] * (n - wr[i])) % mod;
wr[node] += wr[i];
}
}
void dfsc(int node, int pnode){
for(auto &i : c[node]){
if(i == pnode) continue;
dfsc(i, node);
ans = (ans + 1LL * wc[i] * (n - wc[i])) % mod;
wc[node] += wc[i];
}
}
int DistanceSum(int N, int *X, int *Y) {
n = N;
for(int i = 0 ; i < n ; i++){
a.push_back(make_pair(X[i], Y[i]));
}
sort(a.begin(), a.end());
for(int i = 0 ; i < n ; i++){
int j = i;
while(j < n && a[j].first == a[i].first) j++;
gor(i, j);
i = j - 1;
}
sort(a.begin(), a.end(), [&](pair <int, int> l, pair <int, int> r){
return make_pair(l.second, l.first) < make_pair(r.second, r.first);
});
for(int i = 0 ; i < n ; i++){
int j = i;
while(j < n && a[j].second == a[j].second) j++;
goc(i, j);
i = j - 1;
}
dfsr(0, -1);
dfsc(0, -1);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
9728 KB |
Output is correct |
2 |
Correct |
10 ms |
9728 KB |
Output is correct |
3 |
Correct |
12 ms |
9728 KB |
Output is correct |
4 |
Correct |
18 ms |
9728 KB |
Output is correct |
5 |
Correct |
21 ms |
9720 KB |
Output is correct |
6 |
Correct |
10 ms |
9728 KB |
Output is correct |
7 |
Correct |
10 ms |
9728 KB |
Output is correct |
8 |
Correct |
9 ms |
9728 KB |
Output is correct |
9 |
Correct |
10 ms |
9728 KB |
Output is correct |
10 |
Correct |
10 ms |
9728 KB |
Output is correct |
11 |
Correct |
9 ms |
9728 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
9984 KB |
Output is correct |
2 |
Correct |
10 ms |
9984 KB |
Output is correct |
3 |
Correct |
11 ms |
10112 KB |
Output is correct |
4 |
Correct |
12 ms |
9984 KB |
Output is correct |
5 |
Correct |
11 ms |
10112 KB |
Output is correct |
6 |
Correct |
12 ms |
10112 KB |
Output is correct |
7 |
Correct |
12 ms |
10240 KB |
Output is correct |
8 |
Correct |
12 ms |
10112 KB |
Output is correct |
9 |
Correct |
11 ms |
10112 KB |
Output is correct |
10 |
Correct |
12 ms |
10112 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
12660 KB |
Output is correct |
2 |
Correct |
30 ms |
12860 KB |
Output is correct |
3 |
Correct |
80 ms |
17268 KB |
Output is correct |
4 |
Correct |
61 ms |
17464 KB |
Output is correct |
5 |
Correct |
151 ms |
24816 KB |
Output is correct |
6 |
Correct |
122 ms |
24764 KB |
Output is correct |
7 |
Correct |
134 ms |
25200 KB |
Output is correct |
8 |
Correct |
146 ms |
24688 KB |
Output is correct |
9 |
Correct |
115 ms |
25004 KB |
Output is correct |
10 |
Correct |
150 ms |
29172 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
14196 KB |
Output is correct |
2 |
Correct |
35 ms |
13684 KB |
Output is correct |
3 |
Correct |
93 ms |
21104 KB |
Output is correct |
4 |
Correct |
82 ms |
19620 KB |
Output is correct |
5 |
Correct |
193 ms |
32368 KB |
Output is correct |
6 |
Correct |
164 ms |
27760 KB |
Output is correct |
7 |
Correct |
192 ms |
32584 KB |
Output is correct |
8 |
Correct |
160 ms |
28044 KB |
Output is correct |
9 |
Correct |
170 ms |
27188 KB |
Output is correct |
10 |
Correct |
159 ms |
26868 KB |
Output is correct |