#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 |
12 ms |
3788 KB |
Output is correct |
| 2 |
Correct |
1 ms |
460 KB |
Output is correct |
| 3 |
Correct |
1 ms |
588 KB |
Output is correct |
| 4 |
Correct |
10 ms |
3404 KB |
Output is correct |
| 5 |
Correct |
3 ms |
1996 KB |
Output is correct |
| 6 |
Correct |
1 ms |
460 KB |
Output is correct |
| 7 |
Correct |
1 ms |
576 KB |
Output is correct |
| 8 |
Correct |
1 ms |
716 KB |
Output is correct |
| 9 |
Correct |
1 ms |
844 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1612 KB |
Output is correct |
| 11 |
Correct |
4 ms |
1528 KB |
Output is correct |
| 12 |
Correct |
5 ms |
2124 KB |
Output is correct |
| 13 |
Correct |
3 ms |
1996 KB |
Output is correct |
| 14 |
Correct |
4 ms |
2008 KB |
Output is correct |
| 15 |
Correct |
17 ms |
3712 KB |
Output is correct |
| 16 |
Correct |
12 ms |
3796 KB |
Output is correct |
| 17 |
Correct |
9 ms |
3660 KB |
Output is correct |
| 18 |
Correct |
7 ms |
3504 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
12 ms |
15820 KB |
Output is correct |
| 2 |
Correct |
39 ms |
11884 KB |
Output is correct |
| 3 |
Correct |
193 ms |
75332 KB |
Output is correct |
| 4 |
Correct |
69 ms |
29300 KB |
Output is correct |
| 5 |
Correct |
164 ms |
51680 KB |
Output is correct |
| 6 |
Correct |
599 ms |
109928 KB |
Output is correct |
| 7 |
Correct |
12 ms |
16588 KB |
Output is correct |
| 8 |
Correct |
12 ms |
15816 KB |
Output is correct |
| 9 |
Correct |
2 ms |
716 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
12 ms |
16204 KB |
Output is correct |
| 12 |
Correct |
2 ms |
1100 KB |
Output is correct |
| 13 |
Correct |
39 ms |
11840 KB |
Output is correct |
| 14 |
Correct |
22 ms |
7972 KB |
Output is correct |
| 15 |
Correct |
21 ms |
10316 KB |
Output is correct |
| 16 |
Correct |
19 ms |
4972 KB |
Output is correct |
| 17 |
Correct |
106 ms |
25276 KB |
Output is correct |
| 18 |
Correct |
86 ms |
32120 KB |
Output is correct |
| 19 |
Correct |
88 ms |
29384 KB |
Output is correct |
| 20 |
Correct |
50 ms |
22436 KB |
Output is correct |
| 21 |
Correct |
120 ms |
50500 KB |
Output is correct |
| 22 |
Correct |
166 ms |
51716 KB |
Output is correct |
| 23 |
Correct |
204 ms |
42204 KB |
Output is correct |
| 24 |
Correct |
125 ms |
47556 KB |
Output is correct |
| 25 |
Correct |
461 ms |
96308 KB |
Output is correct |
| 26 |
Correct |
363 ms |
130668 KB |
Output is correct |
| 27 |
Correct |
484 ms |
122940 KB |
Output is correct |
| 28 |
Correct |
594 ms |
109924 KB |
Output is correct |
| 29 |
Correct |
593 ms |
108332 KB |
Output is correct |
| 30 |
Correct |
561 ms |
112328 KB |
Output is correct |
| 31 |
Correct |
495 ms |
72132 KB |
Output is correct |
| 32 |
Correct |
419 ms |
108164 KB |
Output is correct |
