#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 |
1 ms |
604 KB |
Output is correct |
| 3 |
Correct |
1 ms |
604 KB |
Output is correct |
| 4 |
Correct |
5 ms |
3420 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 |
1 ms |
1672 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2140 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2136 KB |
Output is correct |
| 14 |
Correct |
2 ms |
2140 KB |
Output is correct |
| 15 |
Correct |
7 ms |
3772 KB |
Output is correct |
| 16 |
Correct |
9 ms |
3932 KB |
Output is correct |
| 17 |
Correct |
7 ms |
3676 KB |
Output is correct |
| 18 |
Correct |
5 ms |
3420 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
15960 KB |
Output is correct |
| 2 |
Correct |
26 ms |
11820 KB |
Output is correct |
| 3 |
Correct |
152 ms |
72188 KB |
Output is correct |
| 4 |
Correct |
48 ms |
28796 KB |
Output is correct |
| 5 |
Correct |
120 ms |
49840 KB |
Output is correct |
| 6 |
Correct |
414 ms |
106704 KB |
Output is correct |
| 7 |
Correct |
9 ms |
16732 KB |
Output is correct |
| 8 |
Correct |
6 ms |
16000 KB |
Output is correct |
| 9 |
Correct |
2 ms |
860 KB |
Output is correct |
| 10 |
Correct |
1 ms |
604 KB |
Output is correct |
| 11 |
Correct |
7 ms |
16352 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1116 KB |
Output is correct |
| 13 |
Correct |
25 ms |
11868 KB |
Output is correct |
| 14 |
Correct |
15 ms |
8024 KB |
Output is correct |
| 15 |
Correct |
15 ms |
10328 KB |
Output is correct |
| 16 |
Correct |
13 ms |
5024 KB |
Output is correct |
| 17 |
Correct |
69 ms |
24544 KB |
Output is correct |
| 18 |
Correct |
63 ms |
31536 KB |
Output is correct |
| 19 |
Correct |
45 ms |
28692 KB |
Output is correct |
| 20 |
Correct |
36 ms |
22212 KB |
Output is correct |
| 21 |
Correct |
89 ms |
48512 KB |
Output is correct |
| 22 |
Correct |
124 ms |
49820 KB |
Output is correct |
| 23 |
Correct |
141 ms |
40788 KB |
Output is correct |
| 24 |
Correct |
97 ms |
45540 KB |
Output is correct |
| 25 |
Correct |
212 ms |
92900 KB |
Output is correct |
| 26 |
Correct |
232 ms |
128096 KB |
Output is correct |
| 27 |
Correct |
354 ms |
119560 KB |
Output is correct |
| 28 |
Correct |
399 ms |
106596 KB |
Output is correct |
| 29 |
Correct |
405 ms |
104900 KB |
Output is correct |
| 30 |
Correct |
347 ms |
108756 KB |
Output is correct |
| 31 |
Correct |
327 ms |
69964 KB |
Output is correct |
| 32 |
Correct |
254 ms |
106892 KB |
Output is correct |
