Submission #804007

#TimeUsernameProblemLanguageResultExecution timeMemory
804007Dan4LifeIdeal city (IOI12_city)C++17
0 / 100
6 ms492 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll MOD = (ll)1e9; int DistanceSum(int N, int *X, int *Y) { ll 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++){ ans+=(1ll*Y[i]*i-tot+MOD)%MOD; tot+=Y[i], tot%=MOD; } return (int)ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...