#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};
int n, m, depth[4000][4000], ans = 1;
string snow[4000];
bool inside(int x, int y) {
return (x > -1 && x < n && y > -1 && y < m && snow[x][y] != '.');
}
int main() {
iostream::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> snow[i];
deque<pair<int, int>> q;
q.push_back({0, 0});
depth[0][0] = 1;
while (q.size()) {
pair<int, int> c = q.front();
q.pop_front();
ans = max(ans, depth[c.first][c.second]);
for (int i = 0; i < 4; i++) {
int x = c.first + dx[i], y = c.second + dy[i];
if (inside(x, y) && depth[x][y] == 0) {
if (snow[x][y] == snow[c.first][c.second]) {
depth[x][y] = depth[c.first][c.second];
q.push_front({x, y});
} else {
depth[x][y] = depth[c.first][c.second] + 1;
q.push_back({x, y});
}
}
}
}
cout << ans << '\n';
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
3796 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
576 KB |
Output is correct |
| 4 |
Correct |
7 ms |
3536 KB |
Output is correct |
| 5 |
Correct |
3 ms |
2004 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
1 ms |
724 KB |
Output is correct |
| 9 |
Correct |
1 ms |
852 KB |
Output is correct |
| 10 |
Correct |
2 ms |
1620 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1492 KB |
Output is correct |
| 12 |
Correct |
5 ms |
2132 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2004 KB |
Output is correct |
| 14 |
Correct |
3 ms |
1952 KB |
Output is correct |
| 15 |
Correct |
9 ms |
3660 KB |
Output is correct |
| 16 |
Correct |
10 ms |
3884 KB |
Output is correct |
| 17 |
Correct |
8 ms |
3668 KB |
Output is correct |
| 18 |
Correct |
7 ms |
3540 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15828 KB |
Output is correct |
| 2 |
Correct |
32 ms |
10624 KB |
Output is correct |
| 3 |
Correct |
156 ms |
60452 KB |
Output is correct |
| 4 |
Correct |
55 ms |
26060 KB |
Output is correct |
| 5 |
Correct |
128 ms |
42852 KB |
Output is correct |
| 6 |
Correct |
479 ms |
94912 KB |
Output is correct |
| 7 |
Correct |
11 ms |
16612 KB |
Output is correct |
| 8 |
Correct |
10 ms |
15828 KB |
Output is correct |
| 9 |
Correct |
2 ms |
724 KB |
Output is correct |
| 10 |
Correct |
1 ms |
468 KB |
Output is correct |
| 11 |
Correct |
10 ms |
16300 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
32 ms |
10724 KB |
Output is correct |
| 14 |
Correct |
18 ms |
7368 KB |
Output is correct |
| 15 |
Correct |
16 ms |
9680 KB |
Output is correct |
| 16 |
Correct |
16 ms |
4700 KB |
Output is correct |
| 17 |
Correct |
79 ms |
21692 KB |
Output is correct |
| 18 |
Correct |
62 ms |
28584 KB |
Output is correct |
| 19 |
Correct |
50 ms |
26116 KB |
Output is correct |
| 20 |
Correct |
42 ms |
19420 KB |
Output is correct |
| 21 |
Correct |
96 ms |
41876 KB |
Output is correct |
| 22 |
Correct |
125 ms |
42840 KB |
Output is correct |
| 23 |
Correct |
157 ms |
35020 KB |
Output is correct |
| 24 |
Correct |
98 ms |
38900 KB |
Output is correct |
| 25 |
Correct |
298 ms |
81472 KB |
Output is correct |
| 26 |
Correct |
291 ms |
119340 KB |
Output is correct |
| 27 |
Correct |
387 ms |
107788 KB |
Output is correct |
| 28 |
Correct |
480 ms |
94792 KB |
Output is correct |
| 29 |
Correct |
483 ms |
93188 KB |
Output is correct |
| 30 |
Correct |
435 ms |
97308 KB |
Output is correct |
| 31 |
Correct |
393 ms |
62144 KB |
Output is correct |
| 32 |
Correct |
337 ms |
92700 KB |
Output is correct |
