# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126069 | EntityIT | Coin Collecting (JOI19_ho_t4) | C++14 | 83 ms | 4960 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, cnt[N][3], curCoin[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;
++cnt[x][y];
}
for (int i = 1; i <= n; ++i) {
for (int _ = 1; _ <= 2; ++_) curCoin[_] += cnt[i][_], --curCoin[_];
for (int _ = 1; _ <= 2; ++_) {
if (curCoin[_] < 0 && 0 < curCoin[3 - _]) {
int tmp = min(-curCoin[_], curCoin[3 - _]);
ans += tmp;
curCoin[_] += tmp;
curCoin[3 - _] -= tmp;
}
}
ans += abs(curCoin[1]) + abs(curCoin[2]);
}
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... |