1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#pragma GCC optimize("Ofast,unroll-loops")

#include <iostream>


using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    int** plansza = new int* [n];
    for (int i = 0; i < n; i++) {
        plansza[i] = new int[m];
    }

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            char tmp;
            cin >> tmp;
            if (tmp == 'B') plansza[i][j] = 1;
            if (tmp == 'C') plansza[i][j] = 2;
            if (tmp == '.') plansza[i][j] = 0;
        }
    }

    int k;
    cin >> k;

    for (int i = 0; i < k; i++)
    {
        char ruch;
        cin >> ruch;

        if (ruch == 'G')
        {
            for (int i = 0; i < m; i++)
            {
                for (int j = 1; j < n; j++)
                {
                    int element = plansza[j][i];
                    int index = j-1;
                    while (index >= 0 && plansza[index][i] == 0) {
                        index--;
                    }
                    if (index+1 == j) continue;
                    plansza[j][i] = plansza[index+1][i];
                    plansza[index + 1][i] = element;
                }
            }
        }
        if (ruch == 'D')
        {
            for (int i = 0; i < m; i++)
            {
                for (int j = n-1; j > 0; j--)
                {
                    int element = plansza[j][i];
                    int index = j;
                    while (index > 0 && plansza[index][i] == 0) {
                        index--;
                    }
                    if (index == j) continue;
                    plansza[j][i] = plansza[index][i];
                    plansza[index][i] = element;

                }
            }
        }
        if (ruch == 'L')
        {
            for (int i = 0; i < n; i++)
            {
                for (int j = 1; j < m; j++)
                {
                    int element = plansza[i][j];
                    int index = j-1;
                    while (index >= 0 && plansza[i][index] == 0) {
                        index--;
                    }
                    if (index + 1 == j) continue;
                    plansza[i][j] = plansza[i][index+1];
                    plansza[i][index+1] = element;

                }
            }
        }
        if (ruch == 'P')
        {
            for (int i = 0; i < n; i++)
            {
                for (int j = m-1; j >= 0; j--)
                {
                    int element = plansza[i][j];
                    int index = j+1;
                    while (index < m && plansza[i][index] == 0)
                    {
                        index++;
                    }
                    if (index - 1 == j) continue;
                    plansza[i][j] = plansza[i][index - 1];
                    plansza[i][index - 1] = element;

                }
            }
        }

    }

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (plansza[i][j] == 1) cout << 'B';
            if (plansza[i][j] == 2) cout << 'C';
            if (plansza[i][j] == 0) cout << '.';
        }
        cout << '\n';
    }



    return 0;
}