oj.uz

Submission #1039281

# Submission time Handle Problem Language Result Execution time Memory
1039281 2024-07-30T16:10:42 Z a_l_i_r_e_z_a Furniture (JOI20_furniture) C++17
100 / 100
 712 ms 117844 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef long long ll;
typedef long double ld;

#define mp make_pair
// #define int long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define F first
#define S second

const int maxn = 1e3 + 5; 
const int inf = 1e9 + 7;
int n, m, dp[maxn][maxn][2], a[maxn][maxn];
set<int> stc[maxn], str[maxn];

void dfs0(int i, int j){
    dp[i][j][0] = 1;
    if(dp[i][j][1] == 0){
        stc[j].erase(i);
        str[i].erase(j);
    }
    if(j < m - 1){
        if(dp[i][j + 1][0] == 0 && (i == 0 || dp[i - 1][j + 1][0] == 1)){
            dfs0(i, j + 1);
        }
    }
    if(i < n - 1){
        if(dp[i + 1][j][0] == 0 && (j == 0 || dp[i + 1][j - 1][0] == 1)){
            dfs0(i + 1, j);
        }
    }
}

void dfs1(int i, int j){
    dp[i][j][1] = 1;
    if(dp[i][j][0] == 0){
        stc[j].erase(i);
        str[i].erase(j);
    }
    if(j > 0){
        if(dp[i][j - 1][1] == 0 && (i == n - 1 || dp[i + 1][j - 1][1] == 1)){
            dfs1(i, j - 1);
        }
    }
    if(i > 0){
        if(dp[i - 1][j][1] == 0 && (j == m - 1 || dp[i - 1][j + 1][1] == 1)){
            dfs1(i - 1, j);
        }
    }
}

bool roshan(int x, int y){
    bool ans = 0;
    if(y < m - 1){
        if(stc[y + 1].size() && (*stc[y + 1].begin()) < x){
            ans = 1;
        }
    }
    if(x < n - 1){
        if(str[x + 1].size() && (*str[x + 1].begin()) < y){
            ans = 1;
        }
    }
    if(ans == 0) return 0;
    dfs0(x, y);
    dfs1(x, y);
    return 1;
}

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m;
    for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) cin >> a[i][j];
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            str[i].insert(j);
            stc[j].insert(i);
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++) if(a[i][j] == 1) roshan(i, j);
    }
    int q; cin >> q;
    while(q--){
        int i, j; cin >> i >> j;
        i--, j--;
        cout << roshan(i, j) << '\n';
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3420 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 4 ms 3752 KB Output is correct
4 Correct 5 ms 3932 KB Output is correct
5 Correct 5 ms 3904 KB Output is correct
6 Correct 5 ms 4188 KB Output is correct
7 Correct 4 ms 4188 KB Output is correct
8 Correct 4 ms 4188 KB Output is correct
9 Correct 4 ms 4188 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3420 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 4 ms 3752 KB Output is correct
4 Correct 5 ms 3932 KB Output is correct
5 Correct 5 ms 3904 KB Output is correct
6 Correct 5 ms 4188 KB Output is correct
7 Correct 4 ms 4188 KB Output is correct
8 Correct 4 ms 4188 KB Output is correct
9 Correct 4 ms 4188 KB Output is correct
10 Correct 19 ms 8612 KB Output is correct
11 Correct 5 ms 3932 KB Output is correct
12 Correct 631 ms 105488 KB Output is correct
13 Correct 351 ms 95828 KB Output is correct
14 Correct 712 ms 104784 KB Output is correct
15 Correct 696 ms 100832 KB Output is correct
16 Correct 551 ms 108624 KB Output is correct
17 Correct 552 ms 114256 KB Output is correct
18 Correct 661 ms 111444 KB Output is correct
19 Correct 512 ms 117844 KB Output is correct
20 Correct 400 ms 117700 KB Output is correct
21 Correct 460 ms 117840 KB Output is correct