#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;
char c;
void dfs(int a, int b)
{
if (mat[a][b] != c || viz[a][b])
return;
viz[a][b] = 1;
de_add.push_back({ a, b });
for (auto i : dir)
dfs(a + i.first, b + i.second);
}
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;
c = mat[1][1];
if (c == '.')
return cout << 0, 0;
dfs(1, 1);
while (!de_add.empty()) {
swap(de_add, added);
de_add.clear();
ans++;
c = (c == 'F' ? 'R' : 'F');
for (auto i : added)
for (auto j : dir)
dfs(i.first + j.first, i.second + j.second);
}
cout << ans << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
4600 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4600 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4600 KB |
Output is correct |
| 4 |
Correct |
16 ms |
6880 KB |
Output is correct |
| 5 |
Correct |
6 ms |
6880 KB |
Output is correct |
| 6 |
Correct |
2 ms |
6880 KB |
Output is correct |
| 7 |
Correct |
2 ms |
6880 KB |
Output is correct |
| 8 |
Correct |
3 ms |
6880 KB |
Output is correct |
| 9 |
Correct |
3 ms |
6880 KB |
Output is correct |
| 10 |
Correct |
6 ms |
6880 KB |
Output is correct |
| 11 |
Correct |
6 ms |
6880 KB |
Output is correct |
| 12 |
Correct |
10 ms |
6880 KB |
Output is correct |
| 13 |
Correct |
6 ms |
6880 KB |
Output is correct |
| 14 |
Correct |
6 ms |
6880 KB |
Output is correct |
| 15 |
Correct |
20 ms |
6880 KB |
Output is correct |
| 16 |
Correct |
25 ms |
6880 KB |
Output is correct |
| 17 |
Correct |
14 ms |
6880 KB |
Output is correct |
| 18 |
Correct |
16 ms |
6880 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
30900 KB |
Output is correct |
| 2 |
Correct |
63 ms |
30900 KB |
Output is correct |
| 3 |
Correct |
280 ms |
32844 KB |
Output is correct |
| 4 |
Correct |
71 ms |
32844 KB |
Output is correct |
| 5 |
Correct |
182 ms |
32844 KB |
Output is correct |
| 6 |
Correct |
1229 ms |
196740 KB |
Output is correct |
| 7 |
Correct |
33 ms |
196740 KB |
Output is correct |
| 8 |
Correct |
31 ms |
196740 KB |
Output is correct |
| 9 |
Correct |
4 ms |
196740 KB |
Output is correct |
| 10 |
Correct |
3 ms |
196740 KB |
Output is correct |
| 11 |
Correct |
32 ms |
196740 KB |
Output is correct |
| 12 |
Correct |
4 ms |
196740 KB |
Output is correct |
| 13 |
Correct |
62 ms |
196740 KB |
Output is correct |
| 14 |
Correct |
41 ms |
196740 KB |
Output is correct |
| 15 |
Correct |
25 ms |
196740 KB |
Output is correct |
| 16 |
Correct |
31 ms |
196740 KB |
Output is correct |
| 17 |
Correct |
148 ms |
196740 KB |
Output is correct |
| 18 |
Correct |
86 ms |
196740 KB |
Output is correct |
| 19 |
Correct |
69 ms |
196740 KB |
Output is correct |
| 20 |
Correct |
74 ms |
196740 KB |
Output is correct |
| 21 |
Correct |
185 ms |
196740 KB |
Output is correct |
| 22 |
Correct |
173 ms |
196740 KB |
Output is correct |
| 23 |
Correct |
265 ms |
196740 KB |
Output is correct |
| 24 |
Correct |
161 ms |
196740 KB |
Output is correct |
| 25 |
Correct |
359 ms |
196740 KB |
Output is correct |
| 26 |
Execution timed out |
2078 ms |
891268 KB |
Time limit exceeded |
| 27 |
Correct |
1337 ms |
891268 KB |
Output is correct |
| 28 |
Correct |
1194 ms |
891268 KB |
Output is correct |
| 29 |
Correct |
1201 ms |
891268 KB |
Output is correct |
| 30 |
Correct |
1270 ms |
891268 KB |
Output is correct |
| 31 |
Correct |
897 ms |
891268 KB |
Output is correct |
| 32 |
Correct |
1347 ms |
891268 KB |
Output is correct |
