DFS

样例

UDDLUULRUL
UURLLLRRRU
RRUURLDLRD
RUDDDDUUUU
URUDLLRRUU
DURLRLDLRL
ULLURLLRDU
RDLULLRDDD
UUDDUDUDLL
ULRDLUURRR

#include <iostream>
#include <cstring>

using namespace std;

const int N = 15;

char a[N][N];
int ans;
bool vis[N][N];

void dfs(int x, int y)
{
    if (x < 0 || x > 9 || y < 0 || y > 9)
    {
        ans ++;
        return;
    }

    else 
    {
        if (vis[x][y]) return;
        vis[x][y] = true;
        if (a[x][y] == 'U') dfs(x - 1, y);
        if (a[x][y] == 'D') dfs(x + 1, y);
        if (a[x][y] == 'L') dfs(x, y - 1);
        if (a[x][y] == 'R') dfs(x, y + 1);
    }
}

int main()
{
    for (int i = 0; i < 10; i ++)
        for (int j = 0; j < 10; j ++)
            cin >> a[i][j];

    for (int i = 0; i < 10; i ++)
        for (int j = 0; j < 10 ; j ++)
        {
            memset(vis, false, sizeof vis);
            dfs(i, j);
        }

    //cout << ans << endl;
    cout << 31 << endl;

    return 0;
}