#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 |
3584 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 |
3284 KB |
Output is correct |
| 5 |
Correct |
3 ms |
1876 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 |
724 KB |
Output is correct |
| 9 |
Correct |
1 ms |
852 KB |
Output is correct |
| 10 |
Correct |
2 ms |
1624 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1492 KB |
Output is correct |
| 12 |
Correct |
4 ms |
2004 KB |
Output is correct |
| 13 |
Correct |
2 ms |
1876 KB |
Output is correct |
| 14 |
Correct |
2 ms |
1924 KB |
Output is correct |
| 15 |
Correct |
9 ms |
3476 KB |
Output is correct |
| 16 |
Correct |
11 ms |
3648 KB |
Output is correct |
| 17 |
Correct |
11 ms |
3412 KB |
Output is correct |
| 18 |
Correct |
6 ms |
3284 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
15828 KB |
Output is correct |
| 2 |
Correct |
32 ms |
10300 KB |
Output is correct |
| 3 |
Correct |
162 ms |
59660 KB |
Output is correct |
| 4 |
Correct |
51 ms |
25660 KB |
Output is correct |
| 5 |
Correct |
130 ms |
42740 KB |
Output is correct |
| 6 |
Correct |
476 ms |
94264 KB |
Output is correct |
| 7 |
Correct |
10 ms |
16468 KB |
Output is correct |
| 8 |
Correct |
10 ms |
15828 KB |
Output is correct |
| 9 |
Correct |
2 ms |
724 KB |
Output is correct |
| 10 |
Correct |
1 ms |
468 KB |
Output is correct |
| 11 |
Correct |
10 ms |
16212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
34 ms |
10312 KB |
Output is correct |
| 14 |
Correct |
20 ms |
7048 KB |
Output is correct |
| 15 |
Correct |
17 ms |
9316 KB |
Output is correct |
| 16 |
Correct |
17 ms |
4356 KB |
Output is correct |
| 17 |
Correct |
81 ms |
21196 KB |
Output is correct |
| 18 |
Correct |
62 ms |
28256 KB |
Output is correct |
| 19 |
Correct |
51 ms |
25596 KB |
Output is correct |
| 20 |
Correct |
40 ms |
19056 KB |
Output is correct |
| 21 |
Correct |
99 ms |
41420 KB |
Output is correct |
| 22 |
Correct |
127 ms |
42832 KB |
Output is correct |
| 23 |
Correct |
149 ms |
34636 KB |
Output is correct |
| 24 |
Correct |
99 ms |
38664 KB |
Output is correct |
| 25 |
Correct |
341 ms |
80708 KB |
Output is correct |
| 26 |
Correct |
290 ms |
118748 KB |
Output is correct |
| 27 |
Correct |
369 ms |
107264 KB |
Output is correct |
| 28 |
Correct |
513 ms |
94320 KB |
Output is correct |
| 29 |
Correct |
462 ms |
92612 KB |
Output is correct |
| 30 |
Correct |
425 ms |
97076 KB |
Output is correct |
| 31 |
Correct |
385 ms |
62044 KB |
Output is correct |
| 32 |
Correct |
325 ms |
92532 KB |
Output is correct |
