| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 378373 | qwerty234 | Furniture (JOI20_furniture) | C++14 | 5 ms | 2028 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>
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 1e3 + 10, inf = 2e9;
int n, m, q, a[MAXN][MAXN], b[MAXN][MAXN], c[MAXN][MAXN], dia[MAXN][MAXN], cnt[2 * MAXN];
void dfs1(int i, int j) {
if (i < 1 || n < i || j < 1 || m < j || b[i][j] == 0)
return;
b[i][j] = (b[i - 1][j] | b[i][j - 1]);
if (b[i][j] == 0) cnt[dia[i][j]] -= (b[i][j] | c[i][j]), dfs1(i + 1, j), dfs1(i, j + 1);
}
void dfs2(int i, int j) {
if (i < 1 || n < i || j < 1 || m < j || c[i][j] == 0)
return;
c[i][j] = (c[i + 1][j] | c[i][j + 1]);
if (c[i][j] == 0) cnt[dia[i][j]] -= (b[i][j] | c[i][j]), dfs2(i - 1, j), dfs2(i, j - 1);
}
void add(int i, int j) {
b[i][j] = c[i][j] = 0;
cnt[dia[i][j]]--;
dfs1(i + 1, j); dfs1(i, j + 1);
dfs2(i - 1, j); dfs2(i, j - 1);
}
void precalc() {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
b[i][j] = c[i][j] = 1;
int cur = 0;
for (int j = 1; j <= m; j++) {
cur++; int ci = 1, cj = j;
while (ci <= n && cj >= 1) {
dia[ci][cj] = cur; cnt[cur]++;
ci++; cj--;
}
}
for (int i = 2; i <= n; i++) {
cur++; int ci = i, cj = m;
while (ci <= n && cj >= 1) {
dia[ci][cj] = cur; cnt[cur]++;
ci++; cj--;
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (a[i][j] == 1)
add(i, j);
}
main() {
//freopen("input.txt", "r", stdin);
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d", &a[i][j]);
scanf("%d", &q);
precalc();
while (q--) {
int i, j;
scanf("%d %d", &i, &j);
int final = cnt[dia[i][j]] - (b[i][j] & c[i][j]);
if (final == 0) {
printf("0\n");
continue;
}
add(i, j);
printf("1\n");
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
