#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 |
10 ms |
3796 KB |
Output is correct |
| 2 |
Correct |
1 ms |
468 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Correct |
6 ms |
3408 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2004 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
1 ms |
716 KB |
Output is correct |
| 9 |
Correct |
2 ms |
852 KB |
Output is correct |
| 10 |
Correct |
2 ms |
1620 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1492 KB |
Output is correct |
| 12 |
Correct |
5 ms |
2132 KB |
Output is correct |
| 13 |
Correct |
3 ms |
1996 KB |
Output is correct |
| 14 |
Correct |
2 ms |
1996 KB |
Output is correct |
| 15 |
Correct |
9 ms |
3668 KB |
Output is correct |
| 16 |
Correct |
10 ms |
3876 KB |
Output is correct |
| 17 |
Correct |
8 ms |
3640 KB |
Output is correct |
| 18 |
Correct |
6 ms |
3404 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
15868 KB |
Output is correct |
| 2 |
Correct |
32 ms |
11832 KB |
Output is correct |
| 3 |
Correct |
163 ms |
62764 KB |
Output is correct |
| 4 |
Correct |
63 ms |
28748 KB |
Output is correct |
| 5 |
Correct |
129 ms |
45900 KB |
Output is correct |
| 6 |
Correct |
480 ms |
97376 KB |
Output is correct |
| 7 |
Correct |
10 ms |
16596 KB |
Output is correct |
| 8 |
Correct |
10 ms |
15820 KB |
Output is correct |
| 9 |
Correct |
2 ms |
724 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
10 ms |
16248 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1124 KB |
Output is correct |
| 13 |
Correct |
33 ms |
11776 KB |
Output is correct |
| 14 |
Correct |
20 ms |
7884 KB |
Output is correct |
| 15 |
Correct |
16 ms |
10308 KB |
Output is correct |
| 16 |
Correct |
16 ms |
4948 KB |
Output is correct |
| 17 |
Correct |
86 ms |
24364 KB |
Output is correct |
| 18 |
Correct |
64 ms |
31180 KB |
Output is correct |
| 19 |
Correct |
56 ms |
28700 KB |
Output is correct |
| 20 |
Correct |
44 ms |
22184 KB |
Output is correct |
| 21 |
Correct |
108 ms |
44532 KB |
Output is correct |
| 22 |
Correct |
136 ms |
45816 KB |
Output is correct |
| 23 |
Correct |
161 ms |
37676 KB |
Output is correct |
| 24 |
Correct |
112 ms |
41772 KB |
Output is correct |
| 25 |
Correct |
297 ms |
83660 KB |
Output is correct |
| 26 |
Correct |
322 ms |
121792 KB |
Output is correct |
| 27 |
Correct |
387 ms |
110348 KB |
Output is correct |
| 28 |
Correct |
482 ms |
97316 KB |
Output is correct |
| 29 |
Correct |
487 ms |
95720 KB |
Output is correct |
| 30 |
Correct |
426 ms |
99968 KB |
Output is correct |
| 31 |
Correct |
390 ms |
65200 KB |
Output is correct |
| 32 |
Correct |
335 ms |
95704 KB |
Output is correct |
