# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103520 | tincamatei | Coin Collecting (JOI19_ho_t4) | C++14 | 2 ms | 384 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 MAX_N = 100000;
int x[2*MAX_N], y[2*MAX_N];
int main() {
#ifdef HOME
FILE *fin = fopen("input.in", "r");
FILE *fout = fopen("output.out", "w");
#else
FILE *fin = stdin;
FILE *fout = stdout;
#endif
int n, lo, hi;
long long rez = 0LL;
fscanf(fin, "%d", &n);
lo = hi = 0;
for(int i = 0; i < 2 * n; ++i) {
fscanf(fin, "%d%d", &x[i], &y[i]);
if(y[i] <= 1) {
rez = rez + 1 - y[i];
lo++;
} else {
rez = rez + y[i] - 2;
hi++;
}
}
rez = rez + abs(lo - hi) / 2;
sort(x, x + 2 * n);
for(int i = 0; i < 2 * n; ++i)
rez = rez + abs(x[i] - (i / 2 + 1));
fprintf(fout, "%lld", rez);
fclose(fin);
fclose(fout);
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... |