oj.uz

답안 #1053272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053272 2024-08-11T10:12:16 Z Piokemon Furniture (JOI20_furniture) C++17
0 / 100
 14 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

constexpr int N = 100;
bool dasie[N+9][N+9];
bool blok[N+9][N+9];

bool spoko(int n, int m){
    for (int x=0;x<=n;x++){
        for (int y=0;y<=m;y++)dasie[x][y]=0;
    }
    dasie[1][1]=1;
    for (int x=1;x<=n;x++){
        for (int y=1;y<=m;y++){
            if (blok[x][y])continue;
            if (dasie[x][y]){
                if (!blok[x+1][y])dasie[x+1][y]=1;
                if (!blok[x][y+1])dasie[x][y+1]=1;
            }
        }
    }
    if (dasie[n][m])return 1;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin >> n >> m;
    for (int x=1;x<=n;x++){
        for (int y=1;y<=m;y++)cin >> blok[x][y];
    }
    int q,a,b;
    cin >> q;
    while(q--){
        cin >> a >> b;
        blok[a][b]=1;
        if (spoko(n,m)){
            cout << "1\n";
        }
        else{
            blok[a][b]=0;
            cout << "0\n";
        }
    }
    return 0;
}

Compilation message

furniture.cpp: In function 'bool spoko(int, int)':
furniture.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Incorrect 14 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Incorrect 14 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -