#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
constexpr int N = 100;
bool dasie[N+9][N+9];
bool blok[N+9][N+9];
bool spoko(int n, int m){
for (int x=0;x<=n;x++){
for (int y=0;y<=m;y++)dasie[x][y]=0;
}
dasie[1][1]=1;
for (int x=1;x<=n;x++){
for (int y=1;y<=m;y++){
if (blok[x][y])continue;
if (dasie[x][y]){
if (!blok[x+1][y])dasie[x+1][y]=1;
if (!blok[x][y+1])dasie[x][y+1]=1;
}
}
}
if (dasie[n][m])return 1;
return 0;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,m;
cin >> n >> m;
for (int x=1;x<=n;x++){
for (int y=1;y<=m;y++)cin >> blok[x][y];
}
int q,a,b;
cin >> q;
while(q--){
cin >> a >> b;
blok[a][b]=1;
if (spoko(n,m)){
cout << "1\n";
}
else{
blok[a][b]=0;
cout << "0\n";
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Output is correct |
2 |
Correct |
18 ms |
480 KB |
Output is correct |
3 |
Correct |
40 ms |
348 KB |
Output is correct |
4 |
Correct |
71 ms |
348 KB |
Output is correct |
5 |
Correct |
81 ms |
348 KB |
Output is correct |
6 |
Correct |
105 ms |
468 KB |
Output is correct |
7 |
Correct |
100 ms |
344 KB |
Output is correct |
8 |
Correct |
81 ms |
344 KB |
Output is correct |
9 |
Correct |
97 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
344 KB |
Output is correct |
2 |
Correct |
18 ms |
480 KB |
Output is correct |
3 |
Correct |
40 ms |
348 KB |
Output is correct |
4 |
Correct |
71 ms |
348 KB |
Output is correct |
5 |
Correct |
81 ms |
348 KB |
Output is correct |
6 |
Correct |
105 ms |
468 KB |
Output is correct |
7 |
Correct |
100 ms |
344 KB |
Output is correct |
8 |
Correct |
81 ms |
344 KB |
Output is correct |
9 |
Correct |
97 ms |
348 KB |
Output is correct |
10 |
Incorrect |
1048 ms |
344 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |