# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39081 | 14kg | Ideal city (IOI12_city) | C++11 | 29 ms | 2680 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.
#define MOD 1000000000
#define INF 2147483646
#define min2(x,y) (x<y?x:y)
int n;
int cnt_X[100001], cnt_Y[100001];
int DistanceSum(int _n, int *X, int *Y) {
n = _n;
int x_min=INF, y_min=INF;
long long out = 0, t1 = 0, t2 = 0, t3;
for (int i = 0; i < n; i++) x_min = min2(x_min, X[i]), y_min = min2(y_min, Y[i]);
for (int i = 0; i < n; i++) cnt_X[X[i] - x_min]++, cnt_Y[Y[i] - y_min]++;
for (int i = 0; i < n; i++) {
out += t2*(long long)cnt_X[i], out %= MOD;
t1 += cnt_X[i];
t2 += t1;
}
t1 = t2 = 0;
for (int i = 0; i < n; i++) {
out += t2*(long long)cnt_Y[i], out %= MOD;
t1 += cnt_Y[i];
t2 += t1;
}
return (int)out;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |