# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98212 | 2019-02-21T14:43:05 Z | luciocf | Ideal city (IOI12_city) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "city.h" using namespace std; const int maxn = 1e5+10; const int mod = 1e9; typedef long long ll; int n; int x[maxn], y[maxn]; int DistanceSum(int N, int *X, int *Y) { n = N; for (int i = 0; i < n; i++) x[i] = X[i], y[i] = Y[i]; ll ans = 0LL; for (int i = 0; i < n; i++) { for (int j = i+1; j < n; j++) { ans = (ans+(ll)abs(x[i]-x[j]))%mod; ans = (ans+(ll)abs(y[i]-y[j]))%mod; } } return ans; }