# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126518 | EntityIT | Coin Collecting (JOI19_ho_t4) | C++14 | 2 ms | 504 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>
using namespace std;
const int N = (int)1e5 + 5;
int n, cntX[N], curCoin[3], cntY[3];
long long ans;
int main () {
scanf("%d", &n);
for (int i = 1; i <= (n << 1); ++i) {
int x, y; scanf("%d %d", &x, &y);
if (x < 1) ans += 1 - x, x = 1;
if (n < x) ans += x - n, x = n;
if (y < 1) ans += 1 - y, y = 1;
if (2 < y) ans += y - 2, y = 2;
++cntX[x];
++cntY[y];
}
ans += abs(cntY[1] - cntY[2]) / 2;
for (int i = 1, cur = 0; i < n; ++i) {
cur += cntX[i] - 2;
ans += abs(cur);
}
printf("%lld", ans);
return 0;
}
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... |