#include <bits/stdc++.h> using namespace std; constexpr int MAX_N = 503; int n, m, k; char grid[MAX_N][MAX_N]; string moves, legit; void move_left() { for (int i = 0; i < n; ++i) { int k = 0; for (int j = 0; j < m; ++j) { if (grid[i][j] != '.') { grid[i][k++] = grid[i][j]; } } for (int j = k; j < m; ++j) { grid[i][j] = '.'; } } } void move_right() { for (int i = 0; i < n; ++i) { int k = m - 1; for (int j = m - 1; j >= 0; --j) { if (grid[i][j] != '.') { grid[i][k--] = grid[i][j]; } } for (int j = k; j >= 0; --j) { grid[i][j] = '.'; } } } void move_up() { for (int j = 0; j < m; ++j) { int k = 0; for (int i = 0; i < n; ++i) { if (grid[i][j] != '.') { grid[k++][j] = grid[i][j]; } } for (int i = k; i < n; ++i) { grid[i][j] = '.'; } } } void move_down() { for (int j = 0; j < m; ++j) { int k = n - 1; for (int i = n - 1; i >= 0; --i) { if (grid[i][j] != '.') { grid[k--][j] = grid[i][j]; } } for (int i = k; i >= 0; --i) { grid[i][j] = '.'; } } } int main() { cin.sync_with_stdio(0); cout.sync_with_stdio(0); cin >> n >> m; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> grid[i][j]; } } cin >> k; cin >> moves; char temp = moves[0]; for(int i = 1; i < moves.size(); ++i) { if((moves[i] == 'P' || moves[i] == 'L') && (temp == 'G' || temp == 'D')) legit.push_back(temp); else if((moves[i] == 'G' || moves[i] == 'D') && (temp == 'L' || temp == 'P')) legit.push_back(temp); temp = moves[i]; } legit.push_back(temp); //cout << legit << "\n"; for (char move : legit) { if (move == 'L') { move_left(); } else if (move == 'P') { move_right(); } else if (move == 'G') { move_up(); } else if (move == 'D') { move_down(); } } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cout << grid[i][j]; } cout << "\n"; } }
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 130 131 132 133 134 135 136 137 138 139 140 141 | #include <bits/stdc++.h> using namespace std; constexpr int MAX_N = 503; int n, m, k; char grid[MAX_N][MAX_N]; string moves, legit; void move_left() { for (int i = 0; i < n; ++i) { int k = 0; for (int j = 0; j < m; ++j) { if (grid[i][j] != '.') { grid[i][k++] = grid[i][j]; } } for (int j = k; j < m; ++j) { grid[i][j] = '.'; } } } void move_right() { for (int i = 0; i < n; ++i) { int k = m - 1; for (int j = m - 1; j >= 0; --j) { if (grid[i][j] != '.') { grid[i][k--] = grid[i][j]; } } for (int j = k; j >= 0; --j) { grid[i][j] = '.'; } } } void move_up() { for (int j = 0; j < m; ++j) { int k = 0; for (int i = 0; i < n; ++i) { if (grid[i][j] != '.') { grid[k++][j] = grid[i][j]; } } for (int i = k; i < n; ++i) { grid[i][j] = '.'; } } } void move_down() { for (int j = 0; j < m; ++j) { int k = n - 1; for (int i = n - 1; i >= 0; --i) { if (grid[i][j] != '.') { grid[k--][j] = grid[i][j]; } } for (int i = k; i >= 0; --i) { grid[i][j] = '.'; } } } int main() { cin.sync_with_stdio(0); cout.sync_with_stdio(0); cin >> n >> m; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> grid[i][j]; } } cin >> k; cin >> moves; char temp = moves[0]; for(int i = 1; i < moves.size(); ++i) { if((moves[i] == 'P' || moves[i] == 'L') && (temp == 'G' || temp == 'D')) legit.push_back(temp); else if((moves[i] == 'G' || moves[i] == 'D') && (temp == 'L' || temp == 'P')) legit.push_back(temp); temp = moves[i]; } legit.push_back(temp); //cout << legit << "\n"; for (char move : legit) { if (move == 'L') { move_left(); } else if (move == 'P') { move_right(); } else if (move == 'G') { move_up(); } else if (move == 'D') { move_down(); } } for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cout << grid[i][j]; } cout << "\n"; } } |