킹

#include <iostream>
#include <vector>
 
using namespace std;
 
typedef pair<int, int> pp;
pp king, stone;
char map[8][8];
string dire[8] = {"LT", "T", "RT", "L", "R", "LB", "B", "RB"};
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    string a, b;
    int n;
    cin >> a >> b >> n;
 
    int y = a[0] - 'A';
    int x = 8 - (a[1] - '0');
 
    king = pp(x, y);
 
    map[x][y] = 'k';
 
    y = b[0] - 'A';
    x = 8 - (b[1] - '0');
 
    stone = pp(x, y);
    map[x][y] = 's';
 
    while (n--)
    {
        string dir;
        cin >> dir;
 
        for (int i = 0; i < 8; i++)
        {
            if (dir == dire[i])
            {
                int kx = king.first + dx[i];
                int ky = king.second + dy[i];
 
                if (!(kx < 0 || kx >= 8 || ky < 0 || ky >= 8))
                {
                    if (map[kx][ky] == 's')
                    {
                        //돌이 있는 곳으로 이동
                        int sx = stone.first + dx[i];
                        int sy = stone.second + dy[i];
 
                        if (!(sx < 0 || sx >= 8 || sy < 0 || sy >= 8))
                        {
                            map[stone.first][stone.second] = '.';
                            map[sx][sy] = 's';
                            stone = pp(sx, sy);
                            map[king.first][king.second] = '.';
                            map[kx][ky] = 'k';
                            king = pp(kx, ky);
                        }
                    }
                    else
                    {
                        map[king.first][king.second] = '.';
                        map[kx][ky] = 'k';
                        king = pp(kx, ky);
                    }
                }
            }
        }
    }
 
    char fkx = 'A' + king.second;
    cout << fkx << 8 - king.first << ' ';
    char fsx = 'A' + stone.second;
    cout << fsx << 8 - stone.first << '\n';
    return 0;
}