Submission #306781

#	Time	Username	Problem	Language	Result	Execution time	Memory
306781		MrDomino	Furniture (JOI20_furniture)	C++14	5 / 100	5094 ms	17912 KiB

furniture

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 2000 + 7;
int n;
int m;
int a[N][N];
int down[N][N];

void full()
{
    down[n + 1][m] = down[n][m + 1] = 1;
    for (int i = n; i >= 1; i--)
    {
        for (int j = m; j >= 1; j--)
        {
            if (a[i][j] == 0)
            {
                down[i][j] = (down[i + 1][j] > 0) + (down[i][j + 1] > 0);
            }
            else
            {
                down[i][j] = 0;
            }
        }
    }
}

void upd(int r, int c)
{
    for (int i = r; i >= 1; i--)
    {
        for (int j = c; j >= 1; j--)
        {
            if (a[i][j] == 0)
            {
                down[i][j] = (down[i + 1][j] > 0) + (down[i][j + 1] > 0);
            }
            else
            {
                down[i][j] = 0;
            }
        }
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
        }
    }
    full();
    int q;
    cin >> q;
    for (int i = 1; i <= q; i++)
    {
        int r, c;
        cin >> r >> c;
        a[r][c] = 1;
        upd(r, c);
        if (down[1][1] == 0)
        {
            a[r][c] = 0;
            upd(r, c);
            cout << "0\n";
        }
        else
        {
            cout << "1\n";
        }
    }
}

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