// Grzegorz Ryn // Jagiellonian University #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define pb push_back #define eb emplace_back #define mp make_pair #define mt make_tuple #define st first #define nd second #define all(__VAR) (__VAR).begin(), (__VAR).end() #define DEBUG(__VAR) cout << #__VAR << ": " << __VAR << endl; template <typename T, typename U> ostream & operator<<(ostream &out, const pair<T, U> &var) { cout << "{" << var.st << ", " << var.nd << "}"; return out; } template <typename T> ostream & operator<<(ostream &out, const vector<T> &var) { cout << "["; for(int i=0; i<(int)var.size()-1; i++) { cout << var[i] << ", "; } if(var.size()>0) cout << var.back(); cout << "]" << endl; return out; } const int inf = 1'000'000'000; #define EMPTY '.' #define WHITE 'B' #define BLACK 'C' void up(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); vector<int> it(M, 0); for(int i=0; i<N; i++) { for(int j=0; j<M; j++) { if(board[i][j] == EMPTY) { continue; } char cur = board[i][j]; board[i][j] = EMPTY; board[it[j]++][j] = cur; } } } void down(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); vector<int> it(M, N-1); for(int i=N-1; i>=0; i--) { for(int j=0; j<M; j++) { if(board[i][j] == EMPTY) { continue; } char cur = board[i][j]; board[i][j] = EMPTY; board[it[j]--][j] = cur; } } } void left(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); vector<int> it(N, 0); for(int i=0; i<N; i++) { for(int j=0; j<M; j++) { if(board[i][j] == EMPTY) { continue; } char cur = board[i][j]; board[i][j] = EMPTY; board[i][it[i]++] = cur; } } } void right(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); vector<int> it(N, M-1); for(int i=0; i<N; i++) { for(int j=M-1; j>=0; j--) { if(board[i][j] == EMPTY) { continue; } char cur = board[i][j]; board[i][j] = EMPTY; board[i][it[i]--] = cur; } } } void print(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); for(int i=0; i<N; i++) { for(int j=0; j<M; j++) { cout << board[i][j]; } cout << '\n'; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N, M; cin >> N >> M; vector<vector<char>> board(N, vector<char>(M)); for(int i=0; i<N; i++) { for(int j=0; j<M; j++) { cin >> board[i][j]; } } int Q; cin >> Q; while(Q--) { char c; cin >> c; if(c == 'L') { left(board); } else if(c == 'P') { right(board); } else if(c == 'G') { up(board); } else { down(board); } } print(board); return 0; }
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 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 | // Grzegorz Ryn // Jagiellonian University #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define pb push_back #define eb emplace_back #define mp make_pair #define mt make_tuple #define st first #define nd second #define all(__VAR) (__VAR).begin(), (__VAR).end() #define DEBUG(__VAR) cout << #__VAR << ": " << __VAR << endl; template <typename T, typename U> ostream & operator<<(ostream &out, const pair<T, U> &var) { cout << "{" << var.st << ", " << var.nd << "}"; return out; } template <typename T> ostream & operator<<(ostream &out, const vector<T> &var) { cout << "["; for(int i=0; i<(int)var.size()-1; i++) { cout << var[i] << ", "; } if(var.size()>0) cout << var.back(); cout << "]" << endl; return out; } const int inf = 1'000'000'000; #define EMPTY '.' #define WHITE 'B' #define BLACK 'C' void up(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); vector<int> it(M, 0); for(int i=0; i<N; i++) { for(int j=0; j<M; j++) { if(board[i][j] == EMPTY) { continue; } char cur = board[i][j]; board[i][j] = EMPTY; board[it[j]++][j] = cur; } } } void down(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); vector<int> it(M, N-1); for(int i=N-1; i>=0; i--) { for(int j=0; j<M; j++) { if(board[i][j] == EMPTY) { continue; } char cur = board[i][j]; board[i][j] = EMPTY; board[it[j]--][j] = cur; } } } void left(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); vector<int> it(N, 0); for(int i=0; i<N; i++) { for(int j=0; j<M; j++) { if(board[i][j] == EMPTY) { continue; } char cur = board[i][j]; board[i][j] = EMPTY; board[i][it[i]++] = cur; } } } void right(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); vector<int> it(N, M-1); for(int i=0; i<N; i++) { for(int j=M-1; j>=0; j--) { if(board[i][j] == EMPTY) { continue; } char cur = board[i][j]; board[i][j] = EMPTY; board[i][it[i]--] = cur; } } } void print(vector<vector<char>>& board) { int N = board.size(); int M = board[0].size(); for(int i=0; i<N; i++) { for(int j=0; j<M; j++) { cout << board[i][j]; } cout << '\n'; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N, M; cin >> N >> M; vector<vector<char>> board(N, vector<char>(M)); for(int i=0; i<N; i++) { for(int j=0; j<M; j++) { cin >> board[i][j]; } } int Q; cin >> Q; while(Q--) { char c; cin >> c; if(c == 'L') { left(board); } else if(c == 'P') { right(board); } else if(c == 'G') { up(board); } else { down(board); } } print(board); return 0; } |