Submission #803939

#TimeUsernameProblemLanguageResultExecution timeMemory
803939Dan4LifeIdeal city (IOI12_city)C++17
0 / 100
5 ms468 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...