hdu 1241 Oil Deposits (BFS)

简单BFS

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<string.h>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<vector>
#include<ctime>
#include<queue>
#define hash hashh
using namespace std;
typedef long long ll;
#define inf 1000000000+7

#define sp  system("pause")

char G[120][120];
int vis[120][120];
int n, m;
class node {
public:
	int x, y;
};

int main()
{
	while (cin >> n >> m,n&&m)
	{
		for (int i = 0; i < n; i++)
			scanf("%s", G[i]);
		memset(vis, 0, sizeof vis);
		int ans = 0;
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < m; j++)
			{
				if (G[i][j] == '@'&&!vis[i][j])
				{
					ans++;
					queue<node>q;
					node start;
					start.x = i; start.y = j;
					vis[start.x][start.y] = 1;
					q.push(start);
					while (!q.empty())
					{
						start = q.front();
						q.pop();
						for (int k = -1; k <= 1; k++)
						{
							for (int l = -1; l <= 1; l++)
							{
								if (l ==0&&k==0)continue;
								int tx = start.x + k,ty=start.y+l;
								if (tx >= 0 && tx < n&&ty >= 0 && ty < m&&G[tx][ty] == '@'&&!vis[tx][ty])
								{
									node in;
									in.x = tx, in.y = ty;
									vis[tx][ty] = 1;
									q.push(in);
								}
							}
						}
					}
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}