Submission #1021763

#TimeUsernameProblemLanguageResultExecution timeMemory
1021763vjudge1Ideal city (IOI12_city)C++17
23 / 100
24 ms2140 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...