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;
int mod=1e9;
int DistanceSum(int N, int *X, int *Y) {
sort(X,X+N);
sort(Y,Y+N);
long long ans=0;
for(long long i=0;i<N;i++){
ans+=i*X[i] - (N-i-1) *X[i];
ans%=mod;
}
for(long long i=0;i<N;i++){
ans+=i*Y[i] - (N-i-1) *Y[i];
ans%=mod;
}
return (ans+mod)%mod;
}
| # | 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... |