#include <bits/stdc++.h>
using namespace std;
char mat[4010][4010];
vector <pair <int, int>> de_add, added, dir = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } };
bool viz[4010][4010];
int n, m;
bool is_ok(int a, int b)
{
return (a > 0 && a <= n && b > 0 && b <= m);
}
void dfs(int a, int b, char c)
{
if (mat[a][b] != c || viz[a][b] || !is_ok(a, b))
return;
viz[a][b] = 1;
de_add.push_back({ a, b });
for (auto i : dir)
dfs(a + i.first, b + i.second, c);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> (mat[i] + 1);
int ans = 0;
char act = mat[1][1];
if (act == '.')
return cout << 0, 0;
dfs(1, 1, act);
while (!de_add.empty()) {
swap(de_add, added);
de_add.clear();
ans++;
act = (act == 'F' ? 'R' : 'F');
for (auto i : added)
for (auto j : dir)
dfs(i.first + j.first, i.second + j.second, act);
}
cout << ans << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
4856 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4856 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4856 KB |
Output is correct |
| 4 |
Correct |
18 ms |
7180 KB |
Output is correct |
| 5 |
Correct |
6 ms |
7180 KB |
Output is correct |
| 6 |
Correct |
2 ms |
7180 KB |
Output is correct |
| 7 |
Correct |
2 ms |
7180 KB |
Output is correct |
| 8 |
Correct |
3 ms |
7180 KB |
Output is correct |
| 9 |
Correct |
3 ms |
7180 KB |
Output is correct |
| 10 |
Correct |
6 ms |
7180 KB |
Output is correct |
| 11 |
Correct |
7 ms |
7180 KB |
Output is correct |
| 12 |
Correct |
12 ms |
7180 KB |
Output is correct |
| 13 |
Correct |
6 ms |
7180 KB |
Output is correct |
| 14 |
Correct |
6 ms |
7180 KB |
Output is correct |
| 15 |
Correct |
26 ms |
7180 KB |
Output is correct |
| 16 |
Correct |
28 ms |
7180 KB |
Output is correct |
| 17 |
Correct |
15 ms |
7180 KB |
Output is correct |
| 18 |
Correct |
19 ms |
8664 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
32756 KB |
Output is correct |
| 2 |
Correct |
73 ms |
32756 KB |
Output is correct |
| 3 |
Correct |
326 ms |
51852 KB |
Output is correct |
| 4 |
Correct |
82 ms |
51852 KB |
Output is correct |
| 5 |
Correct |
251 ms |
56204 KB |
Output is correct |
| 6 |
Correct |
1474 ms |
244016 KB |
Output is correct |
| 7 |
Correct |
33 ms |
244016 KB |
Output is correct |
| 8 |
Correct |
31 ms |
244016 KB |
Output is correct |
| 9 |
Correct |
5 ms |
244016 KB |
Output is correct |
| 10 |
Correct |
3 ms |
244016 KB |
Output is correct |
| 11 |
Correct |
33 ms |
244016 KB |
Output is correct |
| 12 |
Correct |
4 ms |
244016 KB |
Output is correct |
| 13 |
Correct |
71 ms |
244016 KB |
Output is correct |
| 14 |
Correct |
42 ms |
244016 KB |
Output is correct |
| 15 |
Correct |
29 ms |
244016 KB |
Output is correct |
| 16 |
Correct |
37 ms |
244016 KB |
Output is correct |
| 17 |
Correct |
185 ms |
244016 KB |
Output is correct |
| 18 |
Correct |
102 ms |
244016 KB |
Output is correct |
| 19 |
Correct |
106 ms |
244016 KB |
Output is correct |
| 20 |
Correct |
86 ms |
244016 KB |
Output is correct |
| 21 |
Correct |
207 ms |
244016 KB |
Output is correct |
| 22 |
Correct |
264 ms |
244016 KB |
Output is correct |
| 23 |
Correct |
319 ms |
244016 KB |
Output is correct |
| 24 |
Correct |
191 ms |
244016 KB |
Output is correct |
| 25 |
Correct |
388 ms |
244016 KB |
Output is correct |
| 26 |
Execution timed out |
2080 ms |
988380 KB |
Time limit exceeded |
| 27 |
Correct |
1620 ms |
988380 KB |
Output is correct |
| 28 |
Correct |
1521 ms |
988380 KB |
Output is correct |
| 29 |
Correct |
1506 ms |
988380 KB |
Output is correct |
| 30 |
Correct |
1576 ms |
988380 KB |
Output is correct |
| 31 |
Correct |
1078 ms |
988380 KB |
Output is correct |
| 32 |
Correct |
1713 ms |
988380 KB |
Output is correct |
