# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
803957 | 2023-08-03T06:40:44 Z | Dan4Life | Ideal city (IOI12_city) | C++17 | 7 ms | 468 KB |
#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; sort(X,X+N), sort(Y,Y+N); for(int j : {0,1}){ ll tot = 0; for(int i = 0; i < N; i++){ ans+=(1ll*X[i]*i-tot+MOD)%MOD; tot+=X[i], tot%=MOD; swap(X[i],Y[i]); } } return (int)ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 468 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 468 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |