#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(0);
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 |
22 ms |
3792 KB |
Output is correct |
| 2 |
Correct |
1 ms |
456 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Correct |
9 ms |
3484 KB |
Output is correct |
| 5 |
Correct |
3 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 |
724 KB |
Output is correct |
| 9 |
Correct |
1 ms |
852 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1620 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1520 KB |
Output is correct |
| 12 |
Correct |
4 ms |
2132 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2004 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2004 KB |
Output is correct |
| 15 |
Correct |
10 ms |
3668 KB |
Output is correct |
| 16 |
Correct |
12 ms |
3780 KB |
Output is correct |
| 17 |
Correct |
8 ms |
3668 KB |
Output is correct |
| 18 |
Correct |
7 ms |
3412 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15828 KB |
Output is correct |
| 2 |
Correct |
32 ms |
11852 KB |
Output is correct |
| 3 |
Correct |
176 ms |
63272 KB |
Output is correct |
| 4 |
Correct |
55 ms |
29256 KB |
Output is correct |
| 5 |
Correct |
137 ms |
46460 KB |
Output is correct |
| 6 |
Correct |
495 ms |
97892 KB |
Output is correct |
| 7 |
Correct |
10 ms |
16588 KB |
Output is correct |
| 8 |
Correct |
10 ms |
15892 KB |
Output is correct |
| 9 |
Correct |
2 ms |
724 KB |
Output is correct |
| 10 |
Correct |
1 ms |
468 KB |
Output is correct |
| 11 |
Correct |
9 ms |
16244 KB |
Output is correct |
| 12 |
Correct |
2 ms |
1108 KB |
Output is correct |
| 13 |
Correct |
34 ms |
11852 KB |
Output is correct |
| 14 |
Correct |
19 ms |
7884 KB |
Output is correct |
| 15 |
Correct |
24 ms |
10288 KB |
Output is correct |
| 16 |
Correct |
16 ms |
4948 KB |
Output is correct |
| 17 |
Correct |
89 ms |
24960 KB |
Output is correct |
| 18 |
Correct |
80 ms |
31848 KB |
Output is correct |
| 19 |
Correct |
57 ms |
29260 KB |
Output is correct |
| 20 |
Correct |
45 ms |
22360 KB |
Output is correct |
| 21 |
Correct |
106 ms |
45260 KB |
Output is correct |
| 22 |
Correct |
132 ms |
46504 KB |
Output is correct |
| 23 |
Correct |
154 ms |
38152 KB |
Output is correct |
| 24 |
Correct |
106 ms |
42324 KB |
Output is correct |
| 25 |
Correct |
302 ms |
84352 KB |
Output is correct |
| 26 |
Correct |
311 ms |
122296 KB |
Output is correct |
| 27 |
Correct |
388 ms |
110888 KB |
Output is correct |
| 28 |
Correct |
483 ms |
97764 KB |
Output is correct |
| 29 |
Correct |
514 ms |
96120 KB |
Output is correct |
| 30 |
Correct |
455 ms |
99664 KB |
Output is correct |
| 31 |
Correct |
397 ms |
64568 KB |
Output is correct |
| 32 |
Correct |
347 ms |
95052 KB |
Output is correct |
