제출 #742533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
742533		josanneo22	Furniture (JOI20_furniture)	C++17	100 / 100	284 ms	19780 KiB

furniture

#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 / 5
• Subtask 2: 95 / 95