oj.uz

Submission #742533

# Submission time Handle Problem Language Result Execution time Memory
742533 2023-05-16T12:13:47 Z josanneo22 Furniture (JOI20_furniture) C++17
100 / 100
 284 ms 19780 KB 
#include <bits/stdc++.h>
using namespace std;

#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second 

const int MN = 1005;

int n, m, q, r, c, a[MN][MN], reach[MN][MN], cnt[MN + MN];

void block(int i, int j) {
	reach[i][j] = 0;
	cnt[i + j]--;
	if (!reach[i + 1][j - 1] && reach[i + 1][j]) block(i + 1, j);
	if (!reach[i + 1][j - 1] && reach[i][j - 1]) block(i, j - 1);
	if (!reach[i - 1][j + 1] && reach[i - 1][j]) block(i - 1, j);
	if (!reach[i - 1][j + 1] && reach[i][j + 1]) block(i, j + 1);
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            reach[i][j] = 1;
            cnt[i + j]++;
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
            if (a[i][j] && reach[i][j]) block(i, j);
        }
    }
    cin >> q;
    while (q--) {
        cin >> r >> c;
        if (!reach[r][c]) printf("1\n");
        else if (cnt[r + c] == 1) printf("0\n");
        else printf("1\n"), block(r, c);
    }

}

signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 3 ms 1108 KB Output is correct
6 Correct 3 ms 1108 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 3 ms 1108 KB Output is correct
6 Correct 3 ms 1108 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 8 ms 1108 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 149 ms 12712 KB Output is correct
13 Correct 53 ms 9616 KB Output is correct
14 Correct 199 ms 17260 KB Output is correct
15 Correct 227 ms 17520 KB Output is correct
16 Correct 237 ms 18424 KB Output is correct
17 Correct 255 ms 19356 KB Output is correct
18 Correct 223 ms 18776 KB Output is correct
19 Correct 284 ms 19760 KB Output is correct
20 Correct 205 ms 19780 KB Output is correct
21 Correct 264 ms 19764 KB Output is correct