Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int ar[2001][2001];
- bool check[2001][2001];
- int n,m;
- int kx[8]={0,0,1,1,1,-1,-1,-1},
- ky[8]={1,-1,1,-1,0,1,-1,0};
- bool dfs(int x,int y){
- if(check[x][y]==true)
- return true;
- check[x][y]=true;
- for(int i=0;i<8;i++){
- if(x+kx[i]>=1 && x+kx[i]<=n && y+ky[i]>=1 && y+ky[i]<=m && ar[x+kx[i]][y+ky[i]]==1 && check[x+kx[i]][y+ky[i]]==false){
- dfs(x+kx[i],y+ky[i]);
- }
- }
- }
- int main(){
- int cnt=0;
- scanf("%d %d",&n,&m);
- for(int i=1;i<=n;i++){
- for(int j=1;j<=m;j++){
- char a;
- scanf(" %c",&a);
- ar[i][j]=a-'0';
- }
- }
- for(int i=1;i<=n;i++){
- for(int j=1;j<=m;j++){
- if(check[i][j]==false && ar[i][j]==1){
- cnt++;
- dfs(i,j);
- }
- }
- }
- printf("%d",cnt);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement