제출 #491863

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491863		jerzyk	Furniture (JOI20_furniture)	C++17	100 / 100	846 ms	114556 KiB

furniture

#include<bits/stdc++.h>

using namespace std;
const int N = 1000 + 7;
int tab[N][N], tab2[N][N];
set<pair<int, int>> czy[N * N];

void Zmien(int i, int j)
{
    if(tab[i][j] == 1)
        return;
    tab[i][j] = 1;
    if(tab2[i][j] == 0)
        czy[i + j - 2].erase(make_pair(i, j));
    if(tab[i + 1][j - 1] == 1)
        Zmien(i + 1, j);
    if(tab[i - 1][j + 1] == 1)
        Zmien(i, j + 1);
}

void Zmien2(int i, int j)
{
    if(tab2[i][j] == 1)
        return;
    tab2[i][j] = 1;
    if(tab[i][j] == 0)
        czy[i + j - 2].erase(make_pair(i, j));
    if(tab2[i + 1][j - 1] == 1)
        Zmien2(i, j - 1);
    if(tab2[i - 1][j + 1] == 1)
        Zmien2(i - 1, j);
}

void Furniture()
{
    int n, q, m, x;
    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        tab[i][0] = 1;
        tab[i][m + 1] = 1;
        tab2[i][0] = 1;
        tab2[i][m + 1] = 1;
        for(int j = 1; j <= m; ++j)
        {
            tab[0][j] = 1;
            tab[n + 1][j] = 1;
            tab2[0][j] = 1;
            tab2[n + 1][j] = 1;
            czy[i + j - 2].insert(make_pair(i, j));
        }
    }
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= m; ++j)
        {
            cin >> x;
            if(x == 1)
            {
                Zmien(i, j);
                Zmien2(i, j);
            }
        }
    }
    cin >> q;
    for(int i = 1; i <= q; ++i)
    {
        int a, b;
        cin >> a >> b;
        if(czy[a + b - 2].size() == 1 && tab[a][b] == 0 && tab2[a][b] == 0)
        {
            cout << 0 << "\n";
        }else
        {
            cout << 1 << "\n";
            Zmien(a, b);
            Zmien2(a, b);
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    Furniture();

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 95 / 95