This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
//#define _int __int128
//#define int long long
int n;int m;int Q;
int gr[1010][1010];
int ok[1010][1010];
void solve(int a,int b){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
ok[i][j]=0;
}
}
ok[1][1]=1;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(gr[i][j]==1){continue;}
ok[i][j]|=ok[i-1][j]|ok[i][j-1];
}
}
if(ok[n][m]){
cout<<"1\n";
}else{
cout<<"0\n";
gr[a][b]=0;
}
}
signed main(){
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 a;int b;
cin>>a>>b;
gr[a][b]=1;
solve(a,b);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |