This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1010;
int n, m;
int g[maxn][maxn];
int dp[maxn][maxn];
int ok() {
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) {
dp[i][j]=0;
}
}
dp[0][0]=1;
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) {
if (dp[i][j]) {
if (!g[i+1][j]) {
dp[i+1][j]=1;
}
if (!g[i][j+1]) {
dp[i][j+1]=1;
}
}
}
}
return dp[n-1][m-1];
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>m;
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) {
cin>>g[i][j];
}
}
assert(ok());
int q;
cin>>q;
while (q--) {
int x,y;
cin>>x>>y;
--x; --y;
g[x][y]=1;
int res=ok();
if (!res) {
g[x][y]=0;
}
cout<<res<<"\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |