【周练3016.3.5】老王修公园（dfs，水）

2
3 4
1 0 0 0 
0 0 1 1
1 1 1 0
5 5
1 1 1 1 0
0 0 1 0 1
0 0 0 0 0
1 1 1 0 0
0 0 1 1 1

2
3

#include <cstdio>
int mx[4]={0,0,1,-1};
int my[4]={1,-1,0,0};
int map[111][111];
int w,h;
int check(int x,int y)
{
	if (x<1 || x>h || y<1 || y>w || map[x][y]==1)
		return 1;		//1表示不能走 
	return 0;
}
void dfs(int x,int y)
{
	if (check(x,y))
		return;
	map[x][y]=1;
	for (int i=0;i<4;i++)
		dfs(x+mx[i],y+my[i]);
}
int main()
{
	int u;
	int ans;
	scanf ("%d",&u);
	while (u--)
	{
		scanf ("%d %d",&h,&w);
		ans=0;
		for (int i=1;i<=h;i++)
		{
			for (int j=1;j<=w;j++)
				scanf ("%d",&map[i][j]);
		}
		for (int i=1;i<=h;i++)
		{
			for (int j=1;j<=w;j++)
			{
				if (map[i][j]==0)
				{
					dfs(i,j);
					ans++;
				}
			}
		}
		printf ("%d\n",ans);
	}
	return 0;
}