oj.uz

답안 #1097246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097246 2024-10-06T14:56:08 Z anmattroi Furniture (JOI20_furniture) C++14
100 / 100
 389 ms 20128 KB 
#include <bits/stdc++.h>

#define maxn 1005
#define fi first
#define se second

using namespace std;

typedef pair<int, int> ii;

int n, m, q;
int a[maxn][maxn];
int cnt[maxn+maxn];

int e[maxn][maxn];

int dv[] = {0, 1, 0, -1};
int dh[] = {1, 0, -1, 0};

void bfs() {
    queue<ii> q;
    q.push({1, 1});
    vector<vector<bool> > V1(n+1, vector<bool>(m+1, false)); V1[1][1] = true;
    while (!q.empty()) {
        auto [u, v] = q.front(); q.pop();
        for (int k = 0; k < 2; k++) {
            int i = u + dv[k], j = v + dh[k];
            if (a[i][j] || V1[i][j]) continue;
            V1[i][j] = true; q.push({i, j});
        }
    }
    q.push({n, m});
    vector<vector<bool> > V2(n+1, vector<bool>(m+1, false)); V2[n][m] = true;
    while (!q.empty()) {
        auto [u, v] = q.front(); q.pop();
        for (int k = 2; k < 4; k++) {
            int i = u + dv[k], j = v + dh[k];
            if (a[i][j] || V2[i][j]) continue;
            V2[i][j] = true; q.push({i, j});
        }

    }

    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) {
        e[i][j] = (V1[i][j]&V2[i][j]);
    }
}

bool check(int x, int y) {
    if (x == 1 && y == 1) return false;
    if (x == n && y == m) return false;
    return ((a[x-1][y] && a[x][y-1]) || (a[x+1][y] && a[x][y+1]) || (!e[x-1][y] && !e[x][y-1]) || (!e[x+1][y] && !e[x][y+1]));
}

void damnfs(int x, int y) {
    queue<ii> q;
    q.push({x, y});
    while (!q.empty()) {
        auto [u, v] = q.front(); q.pop();
        for (int k = 0; k < 4; k++) {
            int i = u + dv[k], j = v + dh[k];
            if (a[i][j]) continue;
            if (!e[i][j]) continue;
            if (check(i, j)) {
                e[i][j] = 0;
                --cnt[i+j];
                q.push({i, j});
            }
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    for (int i = 0; i <= n+1; i++) for (int j = 0; j <= m+1; j++) a[i][j] = 1;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j];
    bfs();
    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (e[i][j]) ++cnt[i+j];
    cin >> q;
    while (q--) {
        int x, y;
        cin >> x >> y;
        if (a[x][y]) {
            cout << "0\n";
            continue;
        }
        if (!e[x][y]) {
            cout << "1\n";
            a[x][y] = 1;
            continue;
        }
        if (cnt[x+y] == 1) {
            cout << "0\n";
            continue;
        }
        cout << "1\n";
        a[x][y] = 1;
        e[x][y] = 0;
        --cnt[x+y];
        damnfs(x, y);
    }

}

Compilation message

furniture.cpp: In function 'void bfs()':
furniture.cpp:25:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   25 |         auto [u, v] = q.front(); q.pop();
      |              ^
furniture.cpp:35:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |         auto [u, v] = q.front(); q.pop();
      |              ^
furniture.cpp: In function 'void damnfs(int, int)':
furniture.cpp:59:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |         auto [u, v] = q.front(); q.pop();
      |              ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 2 ms 1116 KB Output is correct
5 Correct 2 ms 1372 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct

Subtask #2
95.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 2 ms 1116 KB Output is correct
5 Correct 2 ms 1372 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 5 ms 1116 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 128 ms 13136 KB Output is correct
13 Correct 55 ms 10068 KB Output is correct
14 Correct 182 ms 17448 KB Output is correct
15 Correct 201 ms 17852 KB Output is correct
16 Correct 184 ms 18768 KB Output is correct
17 Correct 190 ms 19644 KB Output is correct
18 Correct 199 ms 19284 KB Output is correct
19 Correct 389 ms 20128 KB Output is correct
20 Correct 171 ms 20048 KB Output is correct
21 Correct 209 ms 20044 KB Output is correct