Submission #732230

#TimeUsernameProblemLanguageResultExecution timeMemory
732230vjudge1Emacs (COCI20_emacs)C++17
50 / 50
1 ms468 KiB
#include<bits/stdc++.h> #define int long long #define MOD 1000000007 #define all(x) x.begin(),x.end() #define ff first #define ss second #define pb push_back #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); using namespace std; char arr[105][105]; int n,m,vis[105][105]; bool f(int a,int b){ if(a<0 || a>=n || b<0 || b>=m)return false; if(vis[a][b])return false; if(arr[a][b]=='.')return false; return true; } void dfs(int x,int y){ vis[x][y]=1; if(f(x-1,y))dfs(x-1,y); if(f(x+1,y))dfs(x+1,y); if(f(x,y-1))dfs(x,y-1); if(f(x,y+1))dfs(x,y+1); return; } int32_t main(){ fast; cin>>n>>m; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>arr[i][j]; } } int ans=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(arr[i][j]=='.' || vis[i][j])continue; ans++; dfs(i,j); } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...