제출 #945828

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
945828		efedmrlr	Furniture (JOI20_furniture)	C++17	0 / 100	5096 ms	344 KiB

furniture

// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 105;
const int ALPH = 26;
const int LGN = 25;
constexpr int MOD = 1e9+7;
int n,m,q;
vector<vector<int> > gr(N, vector<int>(N, 0));
bool dfs(int x, int y) {
    if(gr[x][y] || x > n || y > m) return 0;
    if(x == n && y == m) return 1;
    if(dfs(x + 1, y)) return 1;
    if(dfs(x, y + 1)) return 1;
    return 0;

}
inline void solve() {
    cin>>n>>m;
    for(int i = 1; i<=n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> gr[i][j];
        }
    }
    cin >> q;
    for(int i = 1; i<=q; i++) {
        int x,y;
        cin >> x >> y;
        gr[x][y] = 1;
        if(dfs(1, 1)) {
            cout << "1\n";
        }
        else {
            cout << "0\n";
            gr[x][y] = 0;
        }
    }

}
 
signed main() {

    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

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