SRM 578 Div II Level Two: GooseInZooDivTwo, DFS

题目来源: http://community.topcoder.com/stat?c=problem_statement&pm=12545

可以将地图看成是一个图, 实际上就是用DFS搜索整个图有多少个子图. 也就是需要调用多少次DFS才能将图遍历.

代码如下:

#include <string>
#include <vector>

using namespace std;

/************** Program  Begin *********************/
bool cell[60][60];

class GooseInZooDivTwo {
private:
	void dfs(vector <string> & field, int a, int b, int dist)
	{
		for (int i = 0; i < field.size(); i++) {
			for (int j = 0; j < field[0].size(); j++) {
				if (0 == cell[i][j] && abs(a-i) + abs(b-j) <= dist) {
					cell[i][j] = true;
					dfs(field, i, j, dist);
				}
			}
		}
	}
public:
    int count(vector <string> field, int dist) {
	int res = 1;

	for (int i = 0; i < field.size(); i++) {
		for (int j = 0; j < field[0].size(); j++) {
			if ('.' == field[i][j]) {
				cell[i][j] = true;
			} else {
				cell[i][j] = false;
			}	
		}
	}
	int kind = 0;
	for (int i = 0; i < field.size(); i++) {
		for (int j = 0; j <field[0].size(); j++) {
			if (0 == cell[i][j]) {
				dfs(field, i, j, dist);
				++kind;
			}
		}
	}

	/* (2 ^ kind - 1) % 1000000007 */
	while (kind) {
		res = (2 * res) % 1000000007;
		--kind;
	}
	return res - 1;
    }
};

/************** Program End ************************/