| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 869377 | shdfshdfshdf | Ideal city (IOI12_city) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> coor;
int DistanceSum(int n, int *x, int *y){
int minx=4294967295, miny=4294967295;
for (int a=0; a<n; a++) {
minx=min(minx, x[a]);
miny=min(miny, y[a]);
}
for (int a=0; a<n; a++) {
x[a]-=minx;
y[a]-=miny;
}
sort(x, x+n);
sort(y, y+n);
int bx=0, by=0;
for (int a=0; a<n; a++) {
bx+=x[a]-x[0];
by+=y[a]-y[0];
}
int ans=bx+by;
for (int a=1; a<n; a++) {
bx-=(n-a)*(x[a]-x[a-1]);
by-=(n-a)*(y[a]-y[a-1]);
ans+=bx+by;
}
return ans;
}