【DFS】L国的战斗之伞兵

---

思路：

无风点开搜

---

$Code$:

#include <cstdio>
#include <iostream>

using namespace std;

int jl[1001][1001];
char a[1001][1001];
int n,m,sum;
void dfs (int x, int y)//乱搞
{
    
    
	jl[x][y] = 1;   
	if(a[x + 1][y] == 'u') dfs(x + 1, y);                                         
	if(a[x - 1][y] == 'd') dfs(x - 1, y);     
	if(a[x][y + 1] == 'l') dfs(x, y + 1);     
	if(a[x][y - 1] == 'r') dfs(x, y - 1);  
}
int main ()
{
    
    
    scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)
	  for (int j = 1; j <= n; ++j)
		cin>>a[i][j];
	for (int i = 1; i <= n; ++i)
	  for (int j = 1; j <= n; ++j)
	  if (a[i][j] == 'o') dfs(i, j);
	for (int i = 1; i <= n; i++)  
	   for (int j = 1; j <= m; j++) 
	  if(jl[i][j]) sum++;
	  printf("%d",sum); 
}