#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 |
1 |
Correct |
9 ms |
332 KB |
Output is correct |
2 |
Correct |
42 ms |
404 KB |
Output is correct |
3 |
Correct |
107 ms |
384 KB |
Output is correct |
4 |
Correct |
277 ms |
392 KB |
Output is correct |
5 |
Correct |
252 ms |
392 KB |
Output is correct |
6 |
Correct |
313 ms |
512 KB |
Output is correct |
7 |
Correct |
225 ms |
332 KB |
Output is correct |
8 |
Correct |
257 ms |
392 KB |
Output is correct |
9 |
Correct |
191 ms |
388 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
332 KB |
Output is correct |
2 |
Correct |
42 ms |
404 KB |
Output is correct |
3 |
Correct |
107 ms |
384 KB |
Output is correct |
4 |
Correct |
277 ms |
392 KB |
Output is correct |
5 |
Correct |
252 ms |
392 KB |
Output is correct |
6 |
Correct |
313 ms |
512 KB |
Output is correct |
7 |
Correct |
225 ms |
332 KB |
Output is correct |
8 |
Correct |
257 ms |
392 KB |
Output is correct |
9 |
Correct |
191 ms |
388 KB |
Output is correct |
10 |
Incorrect |
2911 ms |
372 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |