#include <bits/stdc++.h>
using namespace std;
char g[4005][4005];
bool vis[4005][4005];
vector<pair<int, int>> layer[4005];
int h, w, dep = 1;
const int dr[4] = {0, 1, 0, -1}, dc[4] = {1, 0, -1, 0};
void dfs (int r, int c, char ch) {
if (!vis[r][c]) layer[dep].push_back({r, c});
vis[r][c] = true;
for (int k = 0; k < 4; k++) {
int rv = r + dr[k], cv = c + dc[k];
if (rv >= 1 && rv <= h && cv >= 1 && cv <= w && !vis[rv][cv] && g[rv][cv] == ch) dfs(rv, cv, ch);
}
}
int main () {
cin >> h >> w;
for (int i = 1; i <= h; i++) for (int j = 1; j <= w; j++) cin >> g[i][j];
dfs(1, 1, g[1][1]);
while (true) {
dep++;
for (auto& [r, c] : layer[dep-1]) dfs(r, c, "RF"[(dep & 1) ^ (g[1][1] == 'R')]);
layer[dep-1].clear();
if (layer[dep].empty()) {
cout << dep-1 << '\n';
return 0;
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
8536 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 4 |
Correct |
13 ms |
9240 KB |
Output is correct |
| 5 |
Correct |
5 ms |
5976 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2652 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2908 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2904 KB |
Output is correct |
| 10 |
Correct |
4 ms |
5724 KB |
Output is correct |
| 11 |
Correct |
3 ms |
4312 KB |
Output is correct |
| 12 |
Correct |
7 ms |
6492 KB |
Output is correct |
| 13 |
Correct |
4 ms |
5892 KB |
Output is correct |
| 14 |
Correct |
4 ms |
5980 KB |
Output is correct |
| 15 |
Correct |
16 ms |
8284 KB |
Output is correct |
| 16 |
Correct |
19 ms |
8416 KB |
Output is correct |
| 17 |
Correct |
14 ms |
7516 KB |
Output is correct |
| 18 |
Correct |
17 ms |
9264 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
33 ms |
64288 KB |
Execution killed with signal 6 |
| 2 |
Correct |
73 ms |
17924 KB |
Output is correct |
| 3 |
Runtime error |
418 ms |
66384 KB |
Execution killed with signal 6 |
| 4 |
Correct |
140 ms |
24072 KB |
Output is correct |
| 5 |
Runtime error |
273 ms |
55120 KB |
Execution killed with signal 6 |
| 6 |
Correct |
1100 ms |
249836 KB |
Output is correct |
| 7 |
Runtime error |
32 ms |
65108 KB |
Execution killed with signal 11 |
| 8 |
Runtime error |
31 ms |
64340 KB |
Execution killed with signal 6 |
| 9 |
Correct |
4 ms |
3164 KB |
Output is correct |
| 10 |
Correct |
3 ms |
2908 KB |
Output is correct |
| 11 |
Correct |
10 ms |
31836 KB |
Output is correct |
| 12 |
Runtime error |
5 ms |
6492 KB |
Execution killed with signal 6 |
| 13 |
Correct |
82 ms |
17920 KB |
Output is correct |
| 14 |
Correct |
43 ms |
13996 KB |
Output is correct |
| 15 |
Runtime error |
37 ms |
21844 KB |
Execution killed with signal 6 |
| 16 |
Correct |
33 ms |
9816 KB |
Output is correct |
| 17 |
Correct |
200 ms |
34056 KB |
Output is correct |
| 18 |
Runtime error |
122 ms |
38404 KB |
Execution killed with signal 6 |
| 19 |
Correct |
130 ms |
23888 KB |
Output is correct |
| 20 |
Runtime error |
106 ms |
32776 KB |
Execution killed with signal 6 |
| 21 |
Runtime error |
262 ms |
56144 KB |
Execution killed with signal 6 |
| 22 |
Runtime error |
260 ms |
55052 KB |
Execution killed with signal 6 |
| 23 |
Runtime error |
469 ms |
105552 KB |
Execution killed with signal 6 |
| 24 |
Runtime error |
253 ms |
55892 KB |
Execution killed with signal 6 |
| 25 |
Runtime error |
485 ms |
66056 KB |
Execution killed with signal 6 |
| 26 |
Runtime error |
873 ms |
1048576 KB |
Execution killed with signal 9 |
| 27 |
Correct |
1298 ms |
774320 KB |
Output is correct |
| 28 |
Correct |
1067 ms |
250284 KB |
Output is correct |
| 29 |
Correct |
1175 ms |
222928 KB |
Output is correct |
| 30 |
Correct |
1140 ms |
393632 KB |
Output is correct |
| 31 |
Correct |
715 ms |
108492 KB |
Output is correct |
| 32 |
Correct |
1156 ms |
584744 KB |
Output is correct |
