Submission #1171694

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171694		DanerZein	Furniture (JOI20_furniture)	C++20	0 / 100	5 ms	1088 KiB

furniture

#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
 
using namespace std;
#define dbg(x) cerr<<#x<<": "<<x<<"\n";
 
/*  
xdxd
*/
 
const long long maxN=1000;
bool llegue[maxN+1][maxN+1];
long long lab[maxN+1][maxN+1];
long long dp[maxN+1][maxN+1];
long long n, m; 
 
bool in(long long i, long long j){
    return i>=1 && j>=1 && i<=n && j<=m;
}
 
void solve(){
    cin>>n>>m;
    for(long long i=1 ; i<=n ; i++){
        for(long long j=1 ; j<=m ; j++) cin>>lab[i][j];
    }
    long long q; cin>>q;
    while(q--){
        long long x, y; cin>>x>>y;
        if(x==1 && y==1){
            cout<<1<<"\n";
            continue;
        }
        lab[x][y]=1;
        for(long long i=1 ; i<=n ; i++){
            for(long long j=1 ; j<=m ; j++) dp[i][j]=0;
        }
        dp[1][1]=1;
        for(long long i=1 ; i<=n ; i++){
            for(long long j=1 ; j<=m ; j++){
                //der
                long long xx=i, yy=j+1;
                if(in(xx, yy) && lab[xx][yy]==0) dp[xx][yy]+=dp[i][j];
                //down
                xx=i+1, yy=j;
                if(in(xx, yy) && lab[xx][yy]==0) dp[xx][yy]+=dp[i][j];
            }
        }
        if(dp[n][m]>=1){
            cout<<1<<"\n";
        }else{
            cout<<0<<"\n";
            lab[x][y]=0;
        }
    }
 
}
 
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

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