This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = (ll)1000000000;
int DistanceSum(int N, int *X, int *Y) {
int ans = 0, tot = 0;
sort(X,X+N), sort(Y,Y+N);
for(int i = 0; i < N; i++){
ans+=(1ll*X[i]*i-tot+MOD)%MOD;
tot+=X[i], tot%=MOD;
}
tot = 0;
for(int i = 0; i < N; i++){
swap(X[i],Y[i]);
ans+=(1ll*X[i]*i-tot+MOD)%MOD;
tot+=X[i], tot%=MOD;
swap(X[i],Y[i]);
}
return (int)ans;
}
# | 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... |