#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 |
13 ms |
3872 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Correct |
8 ms |
3512 KB |
Output is correct |
| 5 |
Correct |
4 ms |
1996 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
2 ms |
752 KB |
Output is correct |
| 9 |
Correct |
2 ms |
856 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1620 KB |
Output is correct |
| 11 |
Correct |
3 ms |
1492 KB |
Output is correct |
| 12 |
Correct |
4 ms |
2132 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2008 KB |
Output is correct |
| 14 |
Correct |
2 ms |
2004 KB |
Output is correct |
| 15 |
Correct |
12 ms |
3652 KB |
Output is correct |
| 16 |
Correct |
14 ms |
3796 KB |
Output is correct |
| 17 |
Correct |
7 ms |
3668 KB |
Output is correct |
| 18 |
Correct |
7 ms |
3412 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
15824 KB |
Output is correct |
| 2 |
Correct |
30 ms |
11844 KB |
Output is correct |
| 3 |
Correct |
187 ms |
75312 KB |
Output is correct |
| 4 |
Correct |
51 ms |
29292 KB |
Output is correct |
| 5 |
Correct |
137 ms |
51592 KB |
Output is correct |
| 6 |
Correct |
477 ms |
109864 KB |
Output is correct |
| 7 |
Correct |
13 ms |
16596 KB |
Output is correct |
| 8 |
Correct |
9 ms |
15872 KB |
Output is correct |
| 9 |
Correct |
2 ms |
712 KB |
Output is correct |
| 10 |
Correct |
1 ms |
468 KB |
Output is correct |
| 11 |
Correct |
13 ms |
16216 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
31 ms |
11840 KB |
Output is correct |
| 14 |
Correct |
21 ms |
7960 KB |
Output is correct |
| 15 |
Correct |
23 ms |
10308 KB |
Output is correct |
| 16 |
Correct |
18 ms |
4956 KB |
Output is correct |
| 17 |
Correct |
84 ms |
25208 KB |
Output is correct |
| 18 |
Correct |
68 ms |
32104 KB |
Output is correct |
| 19 |
Correct |
62 ms |
29304 KB |
Output is correct |
| 20 |
Correct |
41 ms |
22384 KB |
Output is correct |
| 21 |
Correct |
101 ms |
50520 KB |
Output is correct |
| 22 |
Correct |
133 ms |
51560 KB |
Output is correct |
| 23 |
Correct |
155 ms |
42232 KB |
Output is correct |
| 24 |
Correct |
101 ms |
47552 KB |
Output is correct |
| 25 |
Correct |
344 ms |
96332 KB |
Output is correct |
| 26 |
Correct |
252 ms |
130724 KB |
Output is correct |
| 27 |
Correct |
354 ms |
122848 KB |
Output is correct |
| 28 |
Correct |
505 ms |
109780 KB |
Output is correct |
| 29 |
Correct |
444 ms |
108324 KB |
Output is correct |
| 30 |
Correct |
404 ms |
112204 KB |
Output is correct |
| 31 |
Correct |
444 ms |
72040 KB |
Output is correct |
| 32 |
Correct |
339 ms |
108192 KB |
Output is correct |
