#include <bits/stdc++.h>
using namespace std;
const int N = 4005;
int n, m, ans = 0;
bool visited[N][N];
string a[N];
int dx[4] = {0, -1, 0, 1};
int dy[4] = {-1, 0, 1, 0};
bool ok (int x, int y) {
return (x >= 0 && x < n && y >= 0 && y < m && !visited[x][y] && a[x][y] != '.');
}
void bfs (queue <pair <int, int> > &q1, queue <pair <int, int> > &q2) {
if (q1.empty()) return;
ans++;
while (!q1.empty()) {
int x = q1.front().first, y = q1.front().second; q1.pop();
for (int i = 0; i < 4; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
if (!ok(nx, ny)) continue;
visited[nx][ny] = true;
if (a[nx][ny] == a[x][y]) q1.push({nx, ny});
else q2.push({nx, ny});
}
}
bfs(q2, q1);
}
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
queue <pair <int, int> > q1, q2;
q1.push({0, 0});
visited[0][0] = true;
bfs(q1, q2);
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
2680 KB |
Output is correct |
2 |
Correct |
2 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
632 KB |
Output is correct |
4 |
Correct |
11 ms |
2684 KB |
Output is correct |
5 |
Correct |
5 ms |
1656 KB |
Output is correct |
6 |
Correct |
2 ms |
504 KB |
Output is correct |
7 |
Correct |
2 ms |
632 KB |
Output is correct |
8 |
Correct |
3 ms |
632 KB |
Output is correct |
9 |
Correct |
3 ms |
888 KB |
Output is correct |
10 |
Correct |
5 ms |
1528 KB |
Output is correct |
11 |
Correct |
5 ms |
1272 KB |
Output is correct |
12 |
Correct |
8 ms |
1656 KB |
Output is correct |
13 |
Correct |
5 ms |
1656 KB |
Output is correct |
14 |
Correct |
5 ms |
1656 KB |
Output is correct |
15 |
Correct |
16 ms |
2808 KB |
Output is correct |
16 |
Correct |
17 ms |
2680 KB |
Output is correct |
17 |
Correct |
13 ms |
2552 KB |
Output is correct |
18 |
Correct |
11 ms |
2684 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
15864 KB |
Output is correct |
2 |
Correct |
57 ms |
7068 KB |
Output is correct |
3 |
Correct |
303 ms |
79936 KB |
Output is correct |
4 |
Correct |
70 ms |
11896 KB |
Output is correct |
5 |
Correct |
551 ms |
373644 KB |
Output is correct |
6 |
Correct |
984 ms |
44020 KB |
Output is correct |
7 |
Correct |
25 ms |
16504 KB |
Output is correct |
8 |
Correct |
21 ms |
15864 KB |
Output is correct |
9 |
Correct |
4 ms |
636 KB |
Output is correct |
10 |
Correct |
3 ms |
760 KB |
Output is correct |
11 |
Correct |
21 ms |
15992 KB |
Output is correct |
12 |
Correct |
5 ms |
1912 KB |
Output is correct |
13 |
Correct |
62 ms |
7160 KB |
Output is correct |
14 |
Correct |
37 ms |
4984 KB |
Output is correct |
15 |
Correct |
40 ms |
16504 KB |
Output is correct |
16 |
Correct |
30 ms |
2808 KB |
Output is correct |
17 |
Correct |
168 ms |
12920 KB |
Output is correct |
18 |
Correct |
138 ms |
55544 KB |
Output is correct |
19 |
Correct |
77 ms |
11768 KB |
Output is correct |
20 |
Correct |
82 ms |
20344 KB |
Output is correct |
21 |
Correct |
193 ms |
48576 KB |
Output is correct |
22 |
Correct |
574 ms |
373760 KB |
Output is correct |
23 |
Correct |
325 ms |
19216 KB |
Output is correct |
24 |
Correct |
308 ms |
139640 KB |
Output is correct |
25 |
Correct |
613 ms |
220024 KB |
Output is correct |
26 |
Correct |
578 ms |
27620 KB |
Output is correct |
27 |
Correct |
779 ms |
35468 KB |
Output is correct |
28 |
Correct |
1047 ms |
44088 KB |
Output is correct |
29 |
Correct |
1000 ms |
42636 KB |
Output is correct |
30 |
Correct |
918 ms |
40968 KB |
Output is correct |
31 |
Correct |
810 ms |
24668 KB |
Output is correct |
32 |
Correct |
661 ms |
34552 KB |
Output is correct |