Uva572 oil deposits problem solution

subject

https://www.luogu.com.cn/problem/UVA572

Code implementation

#include<bits/stdc++.h>
using namespace std;

const int maxn=100+10;
const int dx[]={
    -1,1, 0,0,-1, 1,-1,1};
const int dy[]={
     0,0,-1,1,-1,-1, 1,1};
int n,m,ans;
int a[maxn][maxn],que[maxn*maxn][2];
bool vis[maxn][maxn];
inline bool inbound(int x,int y){
    return x>=1&&x<=n&&y>=1&&y<=m;}
int main(){
    
	//freopen("a.in","r",stdin);
	//freopen("a.out","w",stdout);
	while(1){
    
		memset(vis,false,sizeof(vis));
		ans=0;
		scanf("%d%d",&n,&m);
		if(n==0)break;
		for(int i=1;i<=n;i++){
    
			for(int j=1;j<=m;j++){
    
				char op;
				scanf(" %c",&op);
				if(op=='*')vis[i][j]=true;
			}
		}
		for(int i=1;i<=n;i++){
    
			for(int j=1;j<=m;j++){
    
				if(!vis[i][j]){
    
					ans++;
					int head=0,tail=0;
					vis[i][j]=true;
					que[tail][0]=i;
					que[tail++][1]=j;
					while(head<tail){
    
						int x=que[head][0],y=que[head++][1];
						for(int k=0;k<8;k++){
    
							int nx=x+dx[k],ny=y+dy[k];
							if(inbound(nx,ny)&&!vis[nx][ny]){
    
								vis[nx][ny]=true;
								que[tail][0]=nx;
								que[tail++][1]=ny;
							}
						}
					}
				}
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}