#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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
3596 KB |
Output is correct |
| 2 |
Correct |
1 ms |
460 KB |
Output is correct |
| 3 |
Correct |
1 ms |
588 KB |
Output is correct |
| 4 |
Correct |
7 ms |
3276 KB |
Output is correct |
| 5 |
Correct |
3 ms |
1956 KB |
Output is correct |
| 6 |
Correct |
1 ms |
460 KB |
Output is correct |
| 7 |
Correct |
1 ms |
588 KB |
Output is correct |
| 8 |
Correct |
1 ms |
700 KB |
Output is correct |
| 9 |
Correct |
1 ms |
844 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1612 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1484 KB |
Output is correct |
| 12 |
Correct |
5 ms |
2060 KB |
Output is correct |
| 13 |
Correct |
4 ms |
1868 KB |
Output is correct |
| 14 |
Correct |
3 ms |
1868 KB |
Output is correct |
| 15 |
Correct |
10 ms |
3376 KB |
Output is correct |
| 16 |
Correct |
12 ms |
3540 KB |
Output is correct |
| 17 |
Correct |
8 ms |
3404 KB |
Output is correct |
| 18 |
Correct |
7 ms |
3276 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
15820 KB |
Output is correct |
| 2 |
Correct |
49 ms |
10348 KB |
Output is correct |
| 3 |
Correct |
203 ms |
59844 KB |
Output is correct |
| 4 |
Correct |
63 ms |
25708 KB |
Output is correct |
| 5 |
Correct |
160 ms |
42984 KB |
Output is correct |
| 6 |
Correct |
607 ms |
94360 KB |
Output is correct |
| 7 |
Correct |
11 ms |
16440 KB |
Output is correct |
| 8 |
Correct |
11 ms |
15836 KB |
Output is correct |
| 9 |
Correct |
2 ms |
716 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
10 ms |
16204 KB |
Output is correct |
| 12 |
Correct |
2 ms |
1100 KB |
Output is correct |
| 13 |
Correct |
37 ms |
10324 KB |
Output is correct |
| 14 |
Correct |
22 ms |
7016 KB |
Output is correct |
| 15 |
Correct |
19 ms |
9296 KB |
Output is correct |
| 16 |
Correct |
18 ms |
4292 KB |
Output is correct |
| 17 |
Correct |
96 ms |
21220 KB |
Output is correct |
| 18 |
Correct |
76 ms |
28176 KB |
Output is correct |
| 19 |
Correct |
62 ms |
25624 KB |
Output is correct |
| 20 |
Correct |
50 ms |
19220 KB |
Output is correct |
| 21 |
Correct |
121 ms |
41496 KB |
Output is correct |
| 22 |
Correct |
166 ms |
42980 KB |
Output is correct |
| 23 |
Correct |
211 ms |
34708 KB |
Output is correct |
| 24 |
Correct |
131 ms |
38748 KB |
Output is correct |
| 25 |
Correct |
400 ms |
80764 KB |
Output is correct |
| 26 |
Correct |
399 ms |
118864 KB |
Output is correct |
| 27 |
Correct |
473 ms |
107444 KB |
Output is correct |
| 28 |
Correct |
582 ms |
94300 KB |
Output is correct |
| 29 |
Correct |
587 ms |
92876 KB |
Output is correct |
| 30 |
Correct |
525 ms |
97084 KB |
Output is correct |
| 31 |
Correct |
490 ms |
62084 KB |
Output is correct |
| 32 |
Correct |
407 ms |
92668 KB |
Output is correct |
