ZOJ 1047 Image Perimeters (BFS)

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1047
1.BFS求出所有在同一个object中的X

2.计算周长时分析X的每一条边，例如是否是边界、是否和旁边某一个X相交

#include <iostream>
#include <cmath>
#include <stdio.h>
#include <vector>
#include <string.h>
using namespace std;

int main()
{
	int row, col, mouse_x, mouse_y;
	char m[20][20];
	vector< pair<int, int> > v;
	while(cin >> row >> col >> mouse_x >> mouse_y && row != 0 && col != 0 && mouse_x != 0 && mouse_y != 0)
	{
		for(int i = 0; i < row; i++)
			for(int j = 0; j < col; j++)
				cin >> m[i][j];

		vector< pair<int, int> > q;
		q.push_back(make_pair(mouse_x-1, mouse_y-1));
		while(q.size() > 0)
		{
			int x = q[0].first, y = q[0].second;
			v.push_back(q[0]);
			m[x][y] = 'o';
			// 8 directions
			if(x - 1 >= 0)
			{
				if(m[x-1][y] == 'X')
				{
					q.push_back(make_pair(x-1, y)); // up
					m[x-1][y] = 'o';
				}
				if(y-1 >= 0 && m[x-1][y-1] == 'X')
				{
					q.push_back(make_pair(x-1, y-1)); // up-left
					m[x-1][y-1] = 'o';
				}
				if(y+1 < col && m[x-1][y+1] == 'X')
				{
					q.push_back(make_pair(x-1, y+1)); // up-right
					m[x-1][y+1] = 'o';
				}
			}
			if(y-1 >= 0 && m[x][y-1] == 'X')
			{
				q.push_back(make_pair(x, y-1)); // left
				m[x][y-1] = 'o';
			}
			if(y+1 < col && m[x][y+1] == 'X')
			{
				q.push_back(make_pair(x, y+1)); // right
				m[x][y+1] = 'o';
			}
			if(x + 1 < row)
			{
				if(m[x+1][y] == 'X')
				{
					q.push_back(make_pair(x+1, y)); // down
					m[x+1][y] = 'o';
				}
				if(y-1 >= 0 && m[x+1][y-1] == 'X')
				{
					q.push_back(make_pair(x+1, y-1)); // down-left
					m[x+1][y-1] = 'o';
				}
				if(y+1 < col && m[x+1][y+1] == 'X')
				{
					q.push_back(make_pair(x+1, y+1)); // down-right
					m[x+1][y+1] = 'o';
				}
			}
			// remove first one
			q.erase(q.begin());
		}

		// calculate perimeters
		int perimeters = 0;
		for(int i = 0; i < v.size(); i++)
		{
			if(v[i].first == 0 || m[v[i].first-1][v[i].second] == '.') // up
				perimeters++;
			if(v[i].second == 0 || m[v[i].first][v[i].second-1] == '.') // left
				perimeters++;
			if(v[i].first == row-1 || m[v[i].first+1][v[i].second] == '.') // down
				perimeters++;
			if(v[i].second == col-1 || m[v[i].first][v[i].second+1] == '.') // right
				perimeters++;
		}
		cout << perimeters << endl;
		v.clear();
	}
}