#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};
int n, m, depth[4000][4000], ans = 1;
char snow[4000][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(i, 0, n) FOR(j, 0, m) cin >> snow[i][j];
deque<pair<int, int>> q;
q.push_back({0, 0});
depth[0][0] = 1;
while (!q.empty()) {
pair<int, int> c = q.front();
q.pop_front();
ans = max(ans, depth[c.first][c.second]);
FOR(i, 0, 4) {
int x = c.first + dx[i], y = c.second + dx[i];
if (inside(x, y) && !depth[x][y]) {
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 |
Incorrect |
7 ms |
2552 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
636 KB |
Output isn't correct |
| 4 |
Incorrect |
7 ms |
3628 KB |
Output isn't correct |
| 5 |
Incorrect |
4 ms |
1528 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
504 KB |
Output isn't correct |
| 8 |
Incorrect |
2 ms |
760 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
760 KB |
Output isn't correct |
| 10 |
Incorrect |
4 ms |
1400 KB |
Output isn't correct |
| 11 |
Incorrect |
4 ms |
2040 KB |
Output isn't correct |
| 12 |
Incorrect |
4 ms |
1656 KB |
Output isn't correct |
| 13 |
Incorrect |
4 ms |
1528 KB |
Output isn't correct |
| 14 |
Incorrect |
4 ms |
1588 KB |
Output isn't correct |
| 15 |
Incorrect |
7 ms |
2552 KB |
Output isn't correct |
| 16 |
Incorrect |
7 ms |
2552 KB |
Output isn't correct |
| 17 |
Incorrect |
7 ms |
2552 KB |
Output isn't correct |
| 18 |
Incorrect |
7 ms |
3704 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
14 ms |
15352 KB |
Output isn't correct |
| 2 |
Incorrect |
28 ms |
6776 KB |
Output isn't correct |
| 3 |
Incorrect |
242 ms |
31592 KB |
Output isn't correct |
| 4 |
Incorrect |
61 ms |
11384 KB |
Output isn't correct |
| 5 |
Incorrect |
140 ms |
20856 KB |
Output isn't correct |
| 6 |
Incorrect |
260 ms |
47736 KB |
Output isn't correct |
| 7 |
Incorrect |
14 ms |
16064 KB |
Output isn't correct |
| 8 |
Incorrect |
14 ms |
15356 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
504 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 11 |
Incorrect |
14 ms |
15708 KB |
Output isn't correct |
| 12 |
Incorrect |
3 ms |
1016 KB |
Output isn't correct |
| 13 |
Incorrect |
28 ms |
6704 KB |
Output isn't correct |
| 14 |
Incorrect |
18 ms |
4856 KB |
Output isn't correct |
| 15 |
Incorrect |
19 ms |
5240 KB |
Output isn't correct |
| 16 |
Incorrect |
13 ms |
2552 KB |
Output isn't correct |
| 17 |
Incorrect |
66 ms |
12152 KB |
Output isn't correct |
| 18 |
Incorrect |
66 ms |
12160 KB |
Output isn't correct |
| 19 |
Incorrect |
62 ms |
11356 KB |
Output isn't correct |
| 20 |
Incorrect |
56 ms |
10616 KB |
Output isn't correct |
| 21 |
Incorrect |
144 ms |
21624 KB |
Output isn't correct |
| 22 |
Incorrect |
139 ms |
20952 KB |
Output isn't correct |
| 23 |
Incorrect |
120 ms |
17784 KB |
Output isn't correct |
| 24 |
Incorrect |
170 ms |
21436 KB |
Output isn't correct |
| 25 |
Incorrect |
242 ms |
31640 KB |
Output isn't correct |
| 26 |
Correct |
204 ms |
40176 KB |
Output is correct |
| 27 |
Incorrect |
259 ms |
38520 KB |
Output isn't correct |
| 28 |
Incorrect |
260 ms |
38584 KB |
Output isn't correct |
| 29 |
Incorrect |
259 ms |
38520 KB |
Output isn't correct |
| 30 |
Incorrect |
257 ms |
37840 KB |
Output isn't correct |
| 31 |
Incorrect |
158 ms |
19524 KB |
Output isn't correct |
| 32 |
Incorrect |
241 ms |
23800 KB |
Output isn't correct |
