4740. 밍이의 블록게임

시뮬레이션 문제다.

#include <iostream>
using namespace std;
 
char map[30][31], q, arr[31];
int t, N, M, Q, i, j, k, pad;
int x, y, nx, ny, cnt, ccnt = 0, dqs, dqe, qs, qqs, qe, mv, f;
int c[30][30], dx[] = { 0,0,1,-1 }, dy[] = { 1,-1,0,0 };
int qq[900][2];
 
void drop() {
    for (i = 0; i < M; ++i) {
        pad = 0;
        for (j = N - 1; j >= 0; --j) {
            if (map[j][i] == '#') pad++;
            else if (pad) {
                map[j + pad][i] = map[j][i];
                map[j][i] = '#';
            }
        }
    }
}
 
void _up() {
    f = 0;
    for (i = 0; i < M; ++i)
        if (map[0][i] != '#') break;
    if (i != M) return;
 
    for (i = 0; i < N - 1; ++i) for (j = 0; j < M; ++j)
        map[i][j] = map[i + 1][j];
 
    for (j = 0; j < M; ++j) {
        map[N - 1][j] = arr[j];
        if (arr[j] == '#') f = 1;
    }
 
    if (f) 
        drop();
}
 
void _left() {
    for (i = 0; i < N; ++i) {
        pad = 0;
        for (j = 0; j < M; ++j) {
            if (map[i][j] == '#') pad++;
            else if (pad) {
                map[i][j - pad] = map[i][j];
                map[i][j] = '#';
            }
        }
    }
}
 
void _right() {
    for (i = 0; i < N; ++i) {
        pad = 0;
        for (j = M - 1; j >= 0; --j) {
            if (map[i][j] == '#') pad++;
            else if (pad) {
                map[i][j + pad] = map[i][j];
                map[i][j] = '#';
            }
        }
    }
}
 
void _del() {
    ccnt++;
    dqs = dqe = 0;
    mv = 0;
    for (i = 0; i < N; ++i) for (j = 0; j < M; ++j) if (map[i][j] != '#' && c[i][j] != ccnt) {
        qqs = qs = qe = dqe;
        qq[qe][0] = i;
        qq[qe++][1] = j;
        cnt = 0;
        c[i][j] = ccnt;
        while (qs < qe) {
            cnt++;
            x = qq[qs][0];
            y = qq[qs++][1];
            for (k = 0; k < 4; ++k) {
                nx = x + dx[k];
                ny = y + dy[k];
                if (nx < 0 || ny < 0 || nx >= N || ny >= M || map[nx][ny] != map[x][y] || c[nx][ny] == ccnt) continue;
                qq[qe][0] = nx;
                qq[qe++][1] = ny;
                c[nx][ny] = ccnt;
            }
        }
        if (cnt > mv) {
            mv = cnt;
            dqs = qqs;
            dqe = qe;
        }
        else if (cnt == mv) {
            dqe = qe;
        }
    }
    while (dqs < dqe) map[qq[dqs][0]][qq[dqs][1]] = '#', dqs++;
    drop();
}
 
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> t;
    for (int tc = 1; tc <= t; ++tc) {
        cin >> N >> M >> Q;
        for (i = 0; i < N; ++i) cin >> map[i];
        while (Q--) {
            cin >> q;
            if (q == 'U') cin >> arr, _up();
            else if (q == 'L') _left();
            else if (q == 'R') _right();
            else if (q == 'D') _del();
        }
        cout << '#' << tc << '\n';
        for (i = 0; i < N; ++i) cout << map[i] << '\n';
        cout << '\n';
    }
    return 0;
}