#include <bits/stdc++.h>
using namespace std;
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.tie(0);
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;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
3928 KB |
Output is correct |
| 2 |
Correct |
0 ms |
604 KB |
Output is correct |
| 3 |
Correct |
1 ms |
604 KB |
Output is correct |
| 4 |
Correct |
5 ms |
3532 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 6 |
Correct |
0 ms |
604 KB |
Output is correct |
| 7 |
Correct |
1 ms |
604 KB |
Output is correct |
| 8 |
Correct |
1 ms |
860 KB |
Output is correct |
| 9 |
Correct |
1 ms |
860 KB |
Output is correct |
| 10 |
Correct |
2 ms |
1628 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1628 KB |
Output is correct |
| 12 |
Correct |
6 ms |
2136 KB |
Output is correct |
| 13 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 14 |
Correct |
2 ms |
2032 KB |
Output is correct |
| 15 |
Correct |
8 ms |
4048 KB |
Output is correct |
| 16 |
Correct |
9 ms |
3928 KB |
Output is correct |
| 17 |
Correct |
6 ms |
3672 KB |
Output is correct |
| 18 |
Correct |
5 ms |
3424 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
15964 KB |
Output is correct |
| 2 |
Correct |
28 ms |
11904 KB |
Output is correct |
| 3 |
Correct |
150 ms |
75448 KB |
Output is correct |
| 4 |
Correct |
47 ms |
29268 KB |
Output is correct |
| 5 |
Correct |
115 ms |
51664 KB |
Output is correct |
| 6 |
Correct |
437 ms |
109880 KB |
Output is correct |
| 7 |
Correct |
8 ms |
16732 KB |
Output is correct |
| 8 |
Correct |
10 ms |
15964 KB |
Output is correct |
| 9 |
Correct |
2 ms |
860 KB |
Output is correct |
| 10 |
Correct |
1 ms |
800 KB |
Output is correct |
| 11 |
Correct |
9 ms |
16220 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 13 |
Correct |
28 ms |
11860 KB |
Output is correct |
| 14 |
Correct |
16 ms |
8020 KB |
Output is correct |
| 15 |
Correct |
12 ms |
10332 KB |
Output is correct |
| 16 |
Correct |
14 ms |
4952 KB |
Output is correct |
| 17 |
Correct |
72 ms |
25172 KB |
Output is correct |
| 18 |
Correct |
54 ms |
32080 KB |
Output is correct |
| 19 |
Correct |
47 ms |
29356 KB |
Output is correct |
| 20 |
Correct |
39 ms |
22612 KB |
Output is correct |
| 21 |
Correct |
92 ms |
50576 KB |
Output is correct |
| 22 |
Correct |
116 ms |
51588 KB |
Output is correct |
| 23 |
Correct |
141 ms |
42316 KB |
Output is correct |
| 24 |
Correct |
92 ms |
47748 KB |
Output is correct |
| 25 |
Correct |
321 ms |
96336 KB |
Output is correct |
| 26 |
Correct |
279 ms |
130852 KB |
Output is correct |
| 27 |
Correct |
303 ms |
122856 KB |
Output is correct |
| 28 |
Correct |
412 ms |
110164 KB |
Output is correct |
| 29 |
Correct |
402 ms |
108232 KB |
Output is correct |
| 30 |
Correct |
366 ms |
112244 KB |
Output is correct |
| 31 |
Correct |
330 ms |
72020 KB |
Output is correct |
| 32 |
Correct |
273 ms |
108336 KB |
Output is correct |
