#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;
char 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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
2424 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
2424 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
2424 KB |
Output isn't correct |
4 |
Incorrect |
4 ms |
2704 KB |
Output isn't correct |
5 |
Incorrect |
3 ms |
2704 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
2704 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
2704 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
2704 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
2704 KB |
Output isn't correct |
10 |
Incorrect |
3 ms |
2704 KB |
Output isn't correct |
11 |
Incorrect |
2 ms |
2704 KB |
Output isn't correct |
12 |
Incorrect |
3 ms |
2704 KB |
Output isn't correct |
13 |
Incorrect |
3 ms |
2704 KB |
Output isn't correct |
14 |
Incorrect |
3 ms |
2704 KB |
Output isn't correct |
15 |
Incorrect |
4 ms |
3664 KB |
Output isn't correct |
16 |
Incorrect |
4 ms |
3912 KB |
Output isn't correct |
17 |
Incorrect |
4 ms |
4036 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
4272 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
13 ms |
17352 KB |
Output isn't correct |
2 |
Incorrect |
10 ms |
17352 KB |
Output isn't correct |
3 |
Incorrect |
39 ms |
35192 KB |
Output isn't correct |
4 |
Incorrect |
13 ms |
35192 KB |
Output isn't correct |
5 |
Incorrect |
23 ms |
43792 KB |
Output isn't correct |
6 |
Incorrect |
34 ms |
47952 KB |
Output isn't correct |
7 |
Incorrect |
13 ms |
47952 KB |
Output isn't correct |
8 |
Incorrect |
13 ms |
47952 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
47952 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
47952 KB |
Output isn't correct |
11 |
Incorrect |
13 ms |
47952 KB |
Output isn't correct |
12 |
Incorrect |
2 ms |
47952 KB |
Output isn't correct |
13 |
Incorrect |
7 ms |
47952 KB |
Output isn't correct |
14 |
Incorrect |
7 ms |
47952 KB |
Output isn't correct |
15 |
Incorrect |
6 ms |
47952 KB |
Output isn't correct |
16 |
Incorrect |
4 ms |
47952 KB |
Output isn't correct |
17 |
Incorrect |
15 ms |
47952 KB |
Output isn't correct |
18 |
Incorrect |
12 ms |
47952 KB |
Output isn't correct |
19 |
Incorrect |
12 ms |
47952 KB |
Output isn't correct |
20 |
Incorrect |
11 ms |
47952 KB |
Output isn't correct |
21 |
Incorrect |
22 ms |
47952 KB |
Output isn't correct |
22 |
Incorrect |
21 ms |
47952 KB |
Output isn't correct |
23 |
Incorrect |
19 ms |
47952 KB |
Output isn't correct |
24 |
Incorrect |
22 ms |
47952 KB |
Output isn't correct |
25 |
Incorrect |
34 ms |
47952 KB |
Output isn't correct |
26 |
Incorrect |
27 ms |
47952 KB |
Output isn't correct |
27 |
Incorrect |
41 ms |
47972 KB |
Output isn't correct |
28 |
Incorrect |
33 ms |
48000 KB |
Output isn't correct |
29 |
Incorrect |
34 ms |
48000 KB |
Output isn't correct |
30 |
Incorrect |
35 ms |
48000 KB |
Output isn't correct |
31 |
Incorrect |
24 ms |
48000 KB |
Output isn't correct |
32 |
Incorrect |
32 ms |
48000 KB |
Output isn't correct |