#include<bits/stdc++.h>
using namespace std;
#define ll long long
int DistanceSum(int N, int *X, int *Y){
map<ll,ll> rows, cols;
for (int i=0; i<N; i++){
rows[X[i]]++;
cols[Y[i]]++;
}
ll res = 0;
ll cur = 0, cl = 0;
for (auto [r, x] : rows){
cur += x*(r-rows.begin()->first);
cl += x;
}
for (auto [r, x] : rows){
res += x*cur;
cl -= x;
cur -= cl;
}
cur = 0; cl = 0;
for (auto [c, x] : cols){
cur += x*(c-cols.begin()->first);
cl += x;
}
for (auto [c, x] : cols){
res += x*cur;
cl -= x;
cur -= cl;
}
return res % 1000000000;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |