#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 |
11 ms |
3788 KB |
Output is correct |
| 2 |
Correct |
1 ms |
460 KB |
Output is correct |
| 3 |
Correct |
1 ms |
564 KB |
Output is correct |
| 4 |
Correct |
10 ms |
3444 KB |
Output is correct |
| 5 |
Correct |
4 ms |
1996 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 |
716 KB |
Output is correct |
| 9 |
Correct |
1 ms |
844 KB |
Output is correct |
| 10 |
Correct |
2 ms |
1600 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1484 KB |
Output is correct |
| 12 |
Correct |
6 ms |
2108 KB |
Output is correct |
| 13 |
Correct |
4 ms |
1936 KB |
Output is correct |
| 14 |
Correct |
2 ms |
1968 KB |
Output is correct |
| 15 |
Correct |
12 ms |
3628 KB |
Output is correct |
| 16 |
Correct |
11 ms |
3864 KB |
Output is correct |
| 17 |
Correct |
8 ms |
3696 KB |
Output is correct |
| 18 |
Correct |
6 ms |
3496 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
15812 KB |
Output is correct |
| 2 |
Correct |
42 ms |
11776 KB |
Output is correct |
| 3 |
Correct |
166 ms |
75272 KB |
Output is correct |
| 4 |
Correct |
86 ms |
29276 KB |
Output is correct |
| 5 |
Correct |
144 ms |
51648 KB |
Output is correct |
| 6 |
Correct |
532 ms |
109968 KB |
Output is correct |
| 7 |
Correct |
12 ms |
16704 KB |
Output is correct |
| 8 |
Correct |
11 ms |
15880 KB |
Output is correct |
| 9 |
Correct |
2 ms |
716 KB |
Output is correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
13 ms |
16204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 13 |
Correct |
37 ms |
11872 KB |
Output is correct |
| 14 |
Correct |
19 ms |
7864 KB |
Output is correct |
| 15 |
Correct |
14 ms |
10304 KB |
Output is correct |
| 16 |
Correct |
22 ms |
4920 KB |
Output is correct |
| 17 |
Correct |
90 ms |
25164 KB |
Output is correct |
| 18 |
Correct |
73 ms |
32032 KB |
Output is correct |
| 19 |
Correct |
59 ms |
29252 KB |
Output is correct |
| 20 |
Correct |
43 ms |
22368 KB |
Output is correct |
| 21 |
Correct |
129 ms |
50548 KB |
Output is correct |
| 22 |
Correct |
138 ms |
51600 KB |
Output is correct |
| 23 |
Correct |
160 ms |
42120 KB |
Output is correct |
| 24 |
Correct |
111 ms |
47528 KB |
Output is correct |
| 25 |
Correct |
355 ms |
96360 KB |
Output is correct |
| 26 |
Correct |
337 ms |
130632 KB |
Output is correct |
| 27 |
Correct |
435 ms |
122944 KB |
Output is correct |
| 28 |
Correct |
540 ms |
110000 KB |
Output is correct |
| 29 |
Correct |
540 ms |
108408 KB |
Output is correct |
| 30 |
Correct |
475 ms |
112284 KB |
Output is correct |
| 31 |
Correct |
451 ms |
72124 KB |
Output is correct |
| 32 |
Correct |
375 ms |
108232 KB |
Output is correct |
