All of us love treasures, right? That's why young Vasya is heading for a Treasure Island.
Treasure Island may be represented as a rectangular table n×mn×m which is surrounded by the ocean. Let us number rows of the field with consecutive integers from 11 to nn from top to bottom and columns with consecutive integers from 11 to mm from left to right. Denote the cell in rr-th row and cc-th column as (r,c)(r,c). Some of the island cells contain impassable forests, and some cells are free and passable. Treasure is hidden in cell (n,m)(n,m).
Vasya got off the ship in cell (1,1)(1,1). Now he wants to reach the treasure. He is hurrying up, so he can move only from cell to the cell in next row (downwards) or next column (rightwards), i.e. from cell (x,y)(x,y) he can move only to cells (x+1,y)(x+1,y) and (x,y+1)(x,y+1). Of course Vasya can't move through cells with impassable forests.
Evil Witch is aware of Vasya's journey and she is going to prevent him from reaching the treasure. Before Vasya's first move she is able to grow using her evil magic impassable forests in previously free cells. Witch is able to grow a forest in any number of any free cells except cells (1,1)(1,1) where Vasya got off his ship and (n,m)(n,m) where the treasure is hidden.
Help Evil Witch by finding out the minimum number of cells she has to turn into impassable forests so that Vasya is no longer able to reach the treasure.
First line of input contains two positive integers nn, mm (3≤n⋅m≤10000003≤n⋅m≤1000000), sizes of the island.
Following nn lines contains strings sisi of length mm describing the island, jj-th character of string sisi equals "#" if cell (i,j)(i,j) contains an impassable forest and "." if the cell is free and passable. Let us remind you that Vasya gets of his ship at the cell (1,1)(1,1), i.e. the first cell of the first row, and he wants to reach cell (n,m)(n,m), i.e. the last cell of the last row.
It's guaranteed, that cells (1,1)(1,1) and (n,m)(n,m) are empty.
Print the only integer kk, which is the minimum number of cells Evil Witch has to turn into impassable forest in order to prevent Vasya from reaching the treasure.
2 2 .. ..
2
4 4 .... #.#. .... .#..
1
3 4 .... .##. ....
2
The following picture illustrates the island in the third example. Blue arrows show possible paths Vasya may use to go from (1,1)(1,1) to (n,m)(n,m). Red illustrates one possible set of cells for the Witch to turn into impassable forest to make Vasya's trip from (1,1)(1,1) to (n,m)(n,m) impossible.
题意：' . '表示可以走，’#‘表示不可走，问从（1，1）到（n,m），要堵住几个位置，才能使（1，1）到（n，m）没有路径可走
题解：首先答案只有三个0，1，2（因为从（1，1）往下走一步只有两条路，向下走或向右走，最多只要堵住这两个点就无路可走了），所以跑两遍DFS即可，第一遍判断是否有一条路，第二次在第一次标记过的基础上再判断是否有第二条路，若没有就是答案1，否则就是答案2；
注意：不能用二维数组保存路径和标记，会爆掉
#include<iostream> #include<algorithm> #include<math.h> #include<string.h> #include<string> #define ll long long #define mx 10000010 using namespace std; char s[mx]; int vis[mx]; int n,m; int dfs(int x,int y) { if(vis[x*m+y]==1||s[x*m+y]=='#'||x>=n||y>=m)//标记过，有阻碍，出界 return 0; if(x==n-1&&y==m-1) return 1; if(x!=0||y!=0) vis[x*m+y]=1; return dfs(x+1,y)||dfs(x,y+1);//两个方向的搜索 } int main() { scanf("%d%d",&n,&m); for(int i=0;i<n;i++) scanf("%s",s+i*m); if(dfs(0,0)==0)//第一次搜索没有路径，直接输出0 printf("0 "); else if(dfs(0,0)==0)//第一次搜索有路径，但是第二次搜索没有，说明仅有一条路径可走 printf("1 "); else printf("2 "); return 0; }