#include <bits/stdc++.h>
using namespace std;
char g[4005][4005];
bitset<4005> vis[4005];
vector<pair<short, short>> cur;
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]) cur.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++;
vector<pair<short, short>> last;
last.swap(cur);
for (auto& [r, c] : last) dfs(r, c, "RF"[(dep & 1) ^ (g[1][1] == 'R')]);
last.clear();
if (cur.empty()) {
cout << dep-1 << '\n';
return 0;
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
4796 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
604 KB |
Output is correct |
| 4 |
Correct |
10 ms |
4784 KB |
Output is correct |
| 5 |
Correct |
4 ms |
4696 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
1 ms |
860 KB |
Output is correct |
| 10 |
Correct |
6 ms |
4700 KB |
Output is correct |
| 11 |
Correct |
4 ms |
5468 KB |
Output is correct |
| 12 |
Correct |
9 ms |
4856 KB |
Output is correct |
| 13 |
Correct |
6 ms |
1728 KB |
Output is correct |
| 14 |
Correct |
3 ms |
1732 KB |
Output is correct |
| 15 |
Correct |
15 ms |
4444 KB |
Output is correct |
| 16 |
Correct |
18 ms |
5024 KB |
Output is correct |
| 17 |
Correct |
12 ms |
2668 KB |
Output is correct |
| 18 |
Correct |
10 ms |
4696 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
17752 KB |
Output is correct |
| 2 |
Correct |
66 ms |
7500 KB |
Output is correct |
| 3 |
Correct |
639 ms |
18872 KB |
Output is correct |
| 4 |
Correct |
164 ms |
11088 KB |
Output is correct |
| 5 |
Correct |
422 ms |
15444 KB |
Output is correct |
| 6 |
Correct |
1106 ms |
183812 KB |
Output is correct |
| 7 |
Correct |
4 ms |
18268 KB |
Output is correct |
| 8 |
Correct |
6 ms |
17756 KB |
Output is correct |
| 9 |
Correct |
3 ms |
2908 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 11 |
Correct |
4 ms |
18012 KB |
Output is correct |
| 12 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 13 |
Correct |
68 ms |
8876 KB |
Output is correct |
| 14 |
Correct |
59 ms |
6976 KB |
Output is correct |
| 15 |
Correct |
39 ms |
6748 KB |
Output is correct |
| 16 |
Correct |
29 ms |
4952 KB |
Output is correct |
| 17 |
Correct |
163 ms |
11188 KB |
Output is correct |
| 18 |
Correct |
144 ms |
11092 KB |
Output is correct |
| 19 |
Correct |
116 ms |
11340 KB |
Output is correct |
| 20 |
Correct |
118 ms |
11092 KB |
Output is correct |
| 21 |
Correct |
330 ms |
15440 KB |
Output is correct |
| 22 |
Correct |
364 ms |
15544 KB |
Output is correct |
| 23 |
Correct |
342 ms |
13392 KB |
Output is correct |
| 24 |
Correct |
329 ms |
15444 KB |
Output is correct |
| 25 |
Correct |
585 ms |
18852 KB |
Output is correct |
| 26 |
Runtime error |
888 ms |
1048576 KB |
Execution killed with signal 9 |
| 27 |
Correct |
1292 ms |
825500 KB |
Output is correct |
| 28 |
Correct |
1037 ms |
191544 KB |
Output is correct |
| 29 |
Correct |
942 ms |
159728 KB |
Output is correct |
| 30 |
Correct |
1014 ms |
345012 KB |
Output is correct |
| 31 |
Correct |
628 ms |
22204 KB |
Output is correct |
| 32 |
Correct |
1230 ms |
597292 KB |
Output is correct |
