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>
constexpr int N = 105;
int n, m, c[N][N], a[N][N];
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
std::cin >> c[i][j];
}
}
a[0][1] = 1;
int Q;
std::cin >> Q;
while (Q--) {
int x, y;
std::cin >> x >> y;
c[x][y] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
a[i][j] = c[i][j] == 0 && (a[i - 1][j] | a[i][j - 1]);
}
}
if (a[n][m]) {
std::cout << 1 << "\n";
} else {
c[x][y] = 0;
std::cout << 0 << "\n";
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |