求条10pts

#include "bits/stdc++.h"
#define mkp make_pair
using namespace std;
int r, c;
int n;
int dircs[1005];
bool mp[55][55];
bool canpark[55][55];
bool vis[55][55];
pair<int, int> st;
int dx[5] = {0, -1, 0, 1, 0};
int dy[5] = {0, 0, -1, 0, 1};
void dfs(pair<int, int> pos, int dirid)
{
    if (dirid > n)
    {
        canpark[pos.first][pos.second] = true;
        return;
    }
    vis[pos.first][pos.second] = true;
    int nowdirc = dircs[dirid];
    int go_dis = (nowdirc & 1 ? r : c);
    for (int i = 1; i <= go_dis; i++)
    {
        int tox = pos.first + i * dx[nowdirc];
        int toy = pos.second + i * dy[nowdirc];
        if (mp[tox][toy] || vis[tox][toy] || tox > r || tox < 1 || toy > c || toy < 1)
            break;
        vis[tox][toy] = true;
        dfs(mkp(tox, toy), dirid + 1);
        vis[tox][toy] = false;
    }
}
signed main()
{
    cin >> r >> c;
    for (int i = 1; i <= r; i++)
    {
        for (int j = 1; j <= c; j++)
        {
            char c;
            cin >> c;
            mp[i][j] = (c == 'X');
            if (c == '*')
                st = mkp(i, j);
        }
    }
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        string k;
        cin >> k;
        if (k == "NORTH")
            dircs[i] = 1;
        else if (k == "WEST")
            dircs[i] = 2;
        else if (k == "SOUTH")
            dircs[i] = 3;
        else
            dircs[i] = 4;
    }
    dfs(st, 1);
    for (int i = 1; i <= r; i++)
    {
        for (int j = 1; j <= c; j++)
        {
            if (canpark[i][j])
                cout << '*';
            else if (mp[i][j])
                cout << 'X';
            else
                cout << '.';
        }
        cout << endl;
    }
}