baekjoon 20327:배열 돌리기 6
20327번 배열 돌리기 6
접근
3, 4번 연산을 고민을 많이 했었다. 한 칸의 좌표를 기준으로 90도 돌리면 어떻게 바뀌는지 일대일대응 함수를 만들려 하니 어려웠다.
하지만 한 줄씩 돌려버린다 생각하니 쉬웠다.
5~8번 연산을 뭐 전체 블럭을 struct으로 묶어야하나 생각했었는데 그럴 필요 전혀 없이 그냥 하나씩 옮기면 됐다.
코드
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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
#include <iostream>
#include <vector>
using namespace std;
void num1(vector<vector<int>>& v, int l);
void num2(vector<vector<int>>& v, int l);
void num3(vector<vector<int>>& v, int l);
void num4(vector<vector<int>>& v, int l);
void num5(vector<vector<int>>& v, int l);
void num6(vector<vector<int>>& v, int l);
void num7(vector<vector<int>>& v, int l);
void num8(vector<vector<int>>& v, int l);
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, r; cin >> n >> r;
int size = 1;
size = size << n;
vector<vector<int>> v(size, vector<int>(size, 0));
for(int i = 0; i < size; i++){
for(int j = 0; j < size; j++){
cin >> v[i][j];
}
}
for(int i = 0; i < r; i++){
int k, l; cin >> k >> l;
switch (k){
case 1:
num1(v, l);
break;
case 2:
num2(v, l);
break;
case 3:
num3(v, l);
break;
case 4:
num4(v, l);
break;
case 5:
num5(v, l);
break;
case 6:
num6(v, l);
break;
case 7:
num7(v, l);
break;
case 8:
num8(v, l);
break;
default:
break;
}
}
for(int i = 0; i < size; i++){
for(int j = 0; j < size; j++){
cout << v[i][j] << " ";
}
cout << "\n";
}
return 0;
}
void num1(vector<vector<int>>& v, int l){
int subsize = 1;
subsize = subsize << l;
int subcount = v.size() / subsize;
for(int i = 0; i < subcount; i++){
for(int j = 0; j < subcount; j++){
for(int k = 0; k < subsize; k++){
//k는 x기준
for(int m = 0; m < subsize/2; m++){
//m는 y기준
int temp = v[i*subsize + m][j*subsize + k];
v[i*subsize + m][j*subsize + k] = v[(i+1)*subsize - m - 1][j*subsize + k];
v[(i+1)*subsize - m - 1][j*subsize + k] = temp;
}
}
}
}
}
void num2(vector<vector<int>>& v, int l){
int subsize = 1;
subsize = subsize << l;
int subcount = v.size() / subsize;
for(int i = 0; i < subcount; i++){
for(int j = 0; j < subcount; j++){
for(int k = 0; k < subsize/2; k++){
//k는 x기준
for(int m = 0; m < subsize; m++){
//m는 y기준
int temp = v[i*subsize + m][j*subsize + k];
v[i*subsize + m][j*subsize + k] = v[i*subsize+m][(j+1)*subsize - k - 1];
v[i*subsize+m][(j+1)*subsize - k - 1] = temp;
}
}
}
}
}
void num3(vector<vector<int>>& v, int l){
//오른쪽 90도 회전
int subsize = 1;
subsize = subsize << l;
int subcount = v.size() / subsize;
for(int i = 0; i < subcount; i++){
for(int j = 0; j < subcount; j++){
vector<vector<int>> temp(subsize, vector<int>(subsize, 0));
for(int k = 0; k < subsize; k++){
for(int m = 0; m < subsize; m++){
temp[k][m] = v[i*subsize + k][j*subsize + m];
}
}
for(int k = 0; k < subsize; k++){
for(int m = 0; m < subsize; m++){
v[i*subsize + m][(j+1)*subsize - 1 - k] = temp[k][m];
}
}
}
}
}
void num4(vector<vector<int>>& v, int l){
//왼쪽 90도 회전
int subsize = 1;
subsize = subsize << l;
int subcount = v.size() / subsize;
for(int i = 0; i < subcount; i++){
for(int j = 0; j < subcount; j++){
vector<vector<int>> temp(subsize, vector<int>(subsize, 0));
for(int k = 0; k < subsize; k++){
for(int m = 0; m < subsize; m++){
temp[k][m] = v[i*subsize + k][j*subsize + m];
}
}
for(int k = 0; k < subsize; k++){
for(int m = 0; m < subsize; m++){
v[(i+1)*subsize - m - 1][j*subsize + k] = temp[k][m];
}
}
}
}
}
void num5(vector<vector<int>>& v, int l){
int subsize = 1;
subsize = subsize << l;
int subcount = v.size() / subsize;
for(int j = 0; j < subcount; j++){
for(int i = 0; i < subcount/2; i++){
for(int k = 0; k < subsize; k++){
for(int m = 0; m < subsize; m++){
int temp = v[i*subsize + k][j*subsize + m];
v[i*subsize + k][j*subsize + m] = v[(subcount - i - 1)*subsize + k][j*subsize +m];
v[(subcount - i - 1)*subsize + k][j*subsize +m] = temp;
}
}
}
}
}
void num6(vector<vector<int>>& v, int l){
int subsize = 1;
subsize = subsize << l;
int subcount = v.size() / subsize;
for(int j = 0; j < subcount/2; j++){
for(int i = 0; i < subcount; i++){
for(int k = 0; k < subsize; k++){
for(int m = 0; m < subsize; m++){
int temp = v[i*subsize + k][j*subsize + m];
v[i*subsize + k][j*subsize + m] = v[i*subsize + k][(subcount - j -1)*subsize +m];
v[i*subsize + k][(subcount - j - 1)*subsize +m] = temp;
}
}
}
}
}
void num7(vector<vector<int>>& v, int l){
//오른쪽 90도 회전
int subsize = 1;
subsize = subsize << l;
int subcount = v.size() / subsize;
vector<vector<int>> temp(v.size(), vector<int>(v.size(), 0));
temp = v; //이렇게 되는 이유 알고싶다 --> reference니까 당연히 되는 듯
for(int i = 0; i < subcount; i++){
for(int j = 0; j < subcount; j++){
for(int k = 0; k < subsize; k++){
for(int m = 0; m < subsize; m++){
v[j*subsize + k][(subcount - i - 1)*subsize + m] = temp[i*subsize + k][j*subsize + m];
}
}
}
}
}
void num8(vector<vector<int>>& v, int l){
//왼쪽 90도 회전
int subsize = 1;
subsize = subsize << l;
int subcount = v.size() / subsize;
vector<vector<int>> temp(v.size(), vector<int>(v.size(), 0));
temp = v; //이렇게 되는 이유 알고싶다.
for(int i = 0; i < subcount; i++){
for(int j = 0; j < subcount; j++){
for(int k = 0; k < subsize; k++){
for(int m = 0; m < subsize; m++){
v[(subcount - j - 1)*subsize + k][i*subsize + m] = temp[i*subsize + k][j*subsize + m];
}
}
}
}
}
배운 점
차근차근히 구현 한다.
This post is licensed under CC BY 4.0 by the author.