# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
709896 | rainboy | Sandcastle 2 (JOI22_ho_t5) | C11 | 1100 ms | 18580 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 <stdio.h>
#include <string.h>
#define NM 50000
int di[] = { -1, 1, 0, 0 };
int dj[] = { 0, 0, -1, 1 };
int min(int a, int b) { return a < b ? a : b; }
int aa[NM], bb[NM], dd[NM], bad[3][3][3][3][NM], cc[3][3][NM], n, m;
int count(int il, int ir, int j, int y, int z) {
int i, w, x, cnt;
if (ir - il < 3) {
cnt = 0;
for (i = il; i <= ir; i++) {
w = min(i - il, 2), x = min(ir - i, 2);
if (bad[w][x][y][z][i * m + j])
cnt++;
}
} else {
cnt = 0;
for (i = il; i < il + 2; i++)
if (bad[i - il][2][y][z][i * m + j])
cnt++;
for (i = ir - 1; i <= ir; i++)
if (bad[2][ir - i][y][z][i * m + j])
cnt++;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |