-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCount_Apartments.cpp
More file actions
56 lines (55 loc) · 1.14 KB
/
Copy pathCount_Apartments.cpp
File metadata and controls
56 lines (55 loc) · 1.14 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>
#define null nullptr
using namespace std;
int n, m;
char ch[1000][1000];
bool vis[1000][1000];
int dx[4] = {0, 0, -1, 1};
int dy[4] = {1, -1, 0, 0};
bool valid(int x, int y)
{
if (x < 0 || x >= n || y < 0 || y >= m || ch[x][y] == '#')
return false;
return true;
}
void dfs(int si, int sj)
{
vis[si][sj] = true;
for (int i = 0; i < 4; i++)
{
int ci = si + dx[i];
int cj = sj + dy[i];
if (valid(ci, cj) && vis[ci][cj] == false)
{
dfs(ci, cj);
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cin >> ch[i][j];
}
}
memset(vis, false, sizeof(vis));
int count = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (ch[i][j] != '#' && vis[i][j] == false)
{
dfs(i, j);
count++;
}
}
}
cout << count << endl;
return 0;
}