oj.uz

Submission #1095847

# Submission time Handle Problem Language Result Execution time Memory
1095847 2024-10-03T10:26:01 Z _8_8_ Furniture (JOI20_furniture) C++17
0 / 100
 1 ms 860 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 1e3 + 12, MOD = (int)1e9 + 7;

int n, m, a[N][N], c[N * 2];

bool ok(int x, int y) {
    return min(x, y) >= 0 && x <= n + 1 && y <= m + 1 && a[x][y];
}
void make(int x, int y) {
    // cout << x << ' ' << y << '\n';
    if(a[x][y]) return;
    a[x][y] = 1;   
    c[x + y]--;
    if(a[x + 1][y - 1]) {
        if(y - 1 >= 1) make(x, y - 1);
        if(x + 1 <= n) make(x + 1, y);
    }
    if(a[x - 1][y + 1]) {
        if(x - 1 >= 1) make(x - 1, y);
        if(y + 1 <= n) make(x, y + 1);
    }
}
void test() {
    cin >> n >> m;
    for(int i = 0; i <= m + 1; i++) {
        a[0][i] = a[n + 1][i] = 1;
    }
    for(int i = 0; i <= n + 1; i++) {
        a[i][0] = a[i][m + 1] = 1;
    }
    a[0][0] = a[n + 1][m + 1] = a[0][m + 1] = a[n + 1][0] = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            c[i + j]++;
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(a[i][j]) {
                a[i][j] = 0;
                make(i, j);
            }
        }
    }
    // return;
    int q;
    cin >> q;
    while(q--) {
        int x, y;
        cin >> x >> y;
        if(a[x][y]) {
            cout << 1 << '\n';
        } else {
            if(c[x + y] > 1) {
                cout << 1 << '\n';
                make(x, y);
            } else {
                cout << 0 << '\n';
            }
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 

    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    return 0;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Incorrect 1 ms 860 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Incorrect 1 ms 860 KB Output isn't correct
3 Halted 0 ms 0 KB -