BOJ)1063 킹

문제: icpc.me/1063

조건에 맞게 시뮬레이션을 돌려주면 된다.

#include <cstdio>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
string mov[] = { "R","L","B","T","RT","LT","RB","LB" };
string a;
int dx[] = { 0,0,-1,1,1,1,-1,-1 };
int dy[] = { 1,-1,0,0,1,-1,1,-1 };
int n, kx, ky, sx, sy;
int chk(int x, int y) {
    return 1 <= x&&x <= 8 && 1 <= y&&y <= 8;
}
void move(string s) {
    for (int i = 0; i < 8; i++) {
        if (s == mov[i]) {
            int nx = kx + dx[i];
            int ny = ky + dy[i];
            if (!chk(nx, ny))return;
            if (sx == nx&&sy == ny) {
                int xx = sx + dx[i];
                int yy = sy + dy[i];
                if (!chk(xx, yy))return;
                sx = xx;
                sy = yy;
            }
            kx = nx;
            ky = ny;
            return;
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    string x, y;
    cin >> x >> y >> n;
    ky = x[0] - 'A' + 1;
    kx = x[1] - '0';
    sy = y[0] - 'A' + 1;
    sx = y[1] - '0';
    while (n--) {
        cin >> a;
        move(a);
    }
    cout << (char)('A' + ky - 1) << kx << '\n' << (char)('A' + sy - 1) << sx;
    return 0;
}