Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- char c;
- long long x,y,res,i,j,a[101][101],b[101][101];
- void dfs(long long r, long long c){
- if(r<1 || r>x || c<1 || c>y ) return;
- if(a[r][c]==1)return;
- if(b[r][c]!=0)return;
- b[r][c]=res;
- dfs(r-1,c);
- dfs(r+1,c);
- dfs(r,c+1);
- dfs(r,c-1);
- }
- int main()
- {
- cin >> x >> y;
- for(i=1;i<=x;i++){
- for(j=1;j<=y;j++){ cin >> c;
- if(c=='.') a[i][j]==1;
- else a[i][j]==0;
- }
- }
- for(i=1;i<=x;i++){
- for(j=1;j<=y;j++){
- if(a[i][j]==0 && b[i][j]==0){
- res++;
- dfs(i,j);
- }
- }
- }
- cout << res;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement