Blue Bridge Cup Maze (dfs+ backtracking)

Question:

Solve:

Try every point violently , See if you can go out of bounds according to the path on the question .

The last three words are worth noting , Go around in circles , This also means that each grid must be marked to prevent infinite recursion .

And don't forget that the ordinate is x Elements , Abscissa is y Elements

Code:

#include <bits/stdc++.h>
using namespace std;
string a[11] = {"...........",
                ".UDDLUULRUL",
                ".UURLLLRRRU",
                ".RRUURLDLRD",
                ".RUDDDDUUUU",
                ".URUDLLRRUU",
                ".DURLRLDLRL",
                ".ULLURLLRDU",
                ".RDLULLRDDD",
                ".UUDDUDUDLL",
                ".ULRDLUURRR"
               };
int res = 0;
bool judge[11][11];
void dfs(int x, int y)
{
    // Out of the border , Add one to the result 
    if(x <= 0 || x > 10 || y <= 0 || y > 10 ) { res++; return; }
    // The point we went through , return 
    if(judge[x][y]) return;
    // Continue to go 
    if(a[x][y] == 'L')      { judge[x][y] = true; dfs(x,y-1); judge[x][y] = false; }
    else if(a[x][y] == 'R') { judge[x][y] = true; dfs(x,y+1); judge[x][y] = false; }
    else if(a[x][y] == 'U') { judge[x][y] = true; dfs(x-1,y); judge[x][y] = false; }
    else if(a[x][y] == 'D') { judge[x][y] = true; dfs(x+1,y); judge[x][y] = false; }
}
int main(void)
{
    memset(judge,false,sizeof(judge));

    for(int i = 1; i <= 10; i++)
    for(int j = 1; j <= 10; j++)
      dfs(i,j);
      
    cout <<res;
    return 0;
}

Statement ： The pictures are from the official website of the Blue Bridge Cup , For the purpose of sorting out personal questions , In case of infringement , Please contact to delete ~