蓝桥杯真题：迷宫

思路：方向都给好了，我们只要对每个起点，都按照他的方向走一遍就好了，如果能走出去就加上这个点，既然是迷宫问题，记录某个点是否访问过是必不可少的。

代码如下所示：

#include <bits/stdc++.h>
using namespace std;
int ans;
vector<vector<char>>s={
{'U','D','D','L','U','U','L','R','U','L'},
{'U','U','R','L','L','L','R','R','R','U'},
{'R','R','U','U','R','L','D','L','R','D'},
{'R','U','D','D','D','D','U','U','U','U'},
{'U','R','U','D','L','L','R','R','U','U'},
{'D','U','R','L','R','L','D','L','R','L'},
{'U','L','L','U','R','L','L','R','D','U'},
{'R','D','L','U','L','L','R','D','D','D'},
{'U','U','D','D','U','D','U','D','L','L'},
{'U','L','R','D','L','U','U','R','R','R'}};
bool vis[10][10];
void dfs(int x,int y)
{
  if(vis[x][y]) return;
  if(x<0 || y<0 || x>=s.size() || y>=s[x].size()) 
  {
    ans++;
    return;
  }
  vis[x][y]=true;
  if(s[x][y]=='U'){
    dfs(x-1,y);
  }else if(s[x][y]=='L'){
    dfs(x,y-1);
  }else if(s[x][y]=='R'){
    dfs(x,y+1);
  }else if(s[x][y]=='D'){
    dfs(x+1,y);
  }else return;
  vis[x][y]=false;
}

int main()
{
  // 请在此输入您的代码
  for(int i=0;i<s.size();++i)
  {
    for(int j=0;j<s[i].size();++j)
    {
      dfs(i,j);
    }
  }
  cout<<ans;
  // cout<<31;
  return 0;
}