upc Shik and Stone#dfs

问题 H: Shik and Stone

题目描述
We have a grid of H rows and W columns. Initially, there is a stone in the top left cell. Shik is trying to move the stone to the bottom right cell. In each step, he can move the stone one cell to its left, up, right, or down (if such cell exists). It is possible that the stone visits a cell multiple times (including the bottom right and the top left cell).

You are given a matrix of characters aij (1≤i≤H, 1≤j≤W). After Shik completes all moving actions, aij is ‘#’ if the stone had ever located at the i-th row and the j-th column during the process of moving. Otherwise, aij is … Please determine whether it is possible that Shik only uses right and down moves in all steps.

Constraints
2≤H,W≤8
ai,j is either ‘#’ or ‘.’.
There exists a valid sequence of moves for Shik to generate the map a.
输入
The input is given from Standard Input in the following format:

H W
a11a12…a1W
:
aH1aH2…aHW
输出
If it is possible that Shik only uses right and down moves, print Possible. Otherwise, print Impossible.
样例输入 Copy
4 5
##…
.##…
…##.
…##
样例输出 Copy
Possible

int h,w;
int main()
{
	cin >> h >> w;
	int cnt = 0;
	for(int i=1;i<=h;i++)
	{
		getchar();
		for(int j=1;j<=w;j++)
		{
			char ch;
			ch = getchar();
			if(ch == '#')	cnt++;
		}
	}
	if(cnt == h+w-1)	printf("Possible\n");
	else	printf("Impossible\n");
	return 0;
}