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
// Witold Milewski
// Potyczki Algorytmiczne - 2022

#include <bits/stdc++.h>
using namespace std;

const int max_n = 501;
vector<vector<char>> board(max_n, vector<char>(max_n));

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);

  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      cin >> board[i][j];

  int k;
  cin >> k;

  string s;
  cin >> s;

  for (char x : s) {
    if (x == 'G') {
      for (int j = 0; j < m; j++) {
        int t = 0;
        for (int i = 0; i < n; i++)
          if (board[i][j] != '.')
            board[t++][j] = board[i][j];
        for (int i = t; i < n; i++)
          board[i][j] = '.';
      }
    }

    if (x == 'D') {
      for (int j = 0; j < m; j++) {
        int b = n - 1;
        for (int i = n - 1; i >= 0; i--)
          if (board[i][j] != '.')
            board[b--][j] = board[i][j];
        for (int i = b; i >= 0; i--)
          board[i][j] = '.';
      }
    }

    if (x == 'L') {
      for (int i = 0; i < n; i++) {
        int l = 0;
        for (int j = 0; j < m; j++)
          if (board[i][j] != '.')
            board[i][l++] = board[i][j];
        for (int j = l; j < m; j++)
          board[i][j] = '.';
      }
    }

    if (x == 'P') {
      for (int i = 0; i < n; i++) {
        int r = m - 1;
        for (int j = m - 1; j >= 0; j--)
          if (board[i][j] != '.')
            board[i][r--] = board[i][j];
        for (int j = r; j >= 0; j--)
          board[i][j] = '.';
      }
    }
  }

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++)
      cout << board[i][j];
    cout << '\n';
  }

  return 0;
}