728x90
https://www.acmicpc.net/problem/16935
16935번: 배열 돌리기 3
크기가 N×M인 배열이 있을 때, 배열에 연산을 R번 적용하려고 한다. 연산은 총 6가지가 있다. 1번 연산은 배열을 상하 반전시키는 연산이다. 1 6 2 9 8 4 → 4 2 9 3 1 8 7 2 6 9 8 2 → 9 2 3 6 1 5 1 8 3 4 2 9 →
www.acmicpc.net
// 코드
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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
|
import java.util.*;
import java.io.*;
public class Main {
// 기능 클래스
static class Oper {
int N, M, R;
int[][] arr;
public Oper( int N, int M, int R, int[][] arr ) {
this.N = N;
this.M = M;
this.R = R;
this.arr = arr;
}
// 1. 상하반전
public void one() {
int n = this.N / 2;
for ( int i = 0, j = N - 1; i < n; ++i, --j ) {
int[] temp = this.arr[i];
this.arr[i] = this.arr[j];
this.arr[j] = temp;
}
}
// 2. 좌우반전
public void two() {
int m = this.M / 2;
for ( int row = 0; row < N; ++row ) {
for ( int i = 0, j = M - 1; i < m; ++i, --j ) {
int temp = arr[row][i];
arr[row][i] = arr[row][j];
arr[row][j] = temp;
}
}
}
// 3. 오른쪽 90도 회전
public void three() {
int[][] temp = new int[arr[0].length][arr.length];
for ( int row = 0; row < N; ++row )
for ( int col = 0; col < M; ++col )
temp[col][ (N - 1) - row ] = arr[row][col];
this.N = arr[0].length;
this.M = arr.length;
this.arr = new int[N][M];
this.arr = temp;
}
// 4. 왼쪽 90도 회전
public void four() {
int[][] temp = new int[arr[0].length][arr.length];
for ( int row = 0; row < N; ++row )
for ( int col = M - 1, col2 = 0; col >= 0; --col, ++col2 )
temp[col2][row] = arr[row][col];
this.N = arr[0].length;
this.M = arr.length;
this.arr = new int[N][M];
this.arr = temp;
}
// 5. group sec1 -> sec2, sec2 -> sec3, sec3 -> sec4, sec4 -> sec1
public void five() {
// 각 영역의 구분점이될 기준값
int cutN = this.N / 2, cutM = this.M / 2;
// sec1, sec2, sec3, sec4 각 영역의 시작좌표, 끝좌표 구하기
int[][] sec1 = new int[2][2];
int[][] sec2 = new int[2][2];
int[][] sec3 = new int[2][2];
int[][] sec4 = new int[2][2];
// sec1
sec1[0][0] = 0; sec1[0][1] = 0;
sec1[1][0] = cutN - 1; sec1[1][1] = cutM - 1;
// sec2
sec2[0][0] = 0; sec2[0][1] = cutM;
sec2[1][0] = cutN - 1; sec2[1][1] = M - 1;
// sec3
sec3[0][0] = cutN; sec3[0][1] = cutM;
sec3[1][0] = N - 1; sec3[1][1] = M - 1;
// sec4
sec4[0][0] = cutN; sec4[0][1] = 0;
sec4[1][0] = N - 1; sec4[1][1] = cutM - 1;
int[][] temp = new int[N][M];
// sec1 -> sec2
for ( int i = sec1[0][0]; i <= sec1[1][0]; ++i )
for ( int j = sec1[0][1]; j <= sec1[1][1]; ++j )
temp[i][j + cutM] = this.arr[i][j];
// sec2 -> sec3
for ( int i = sec2[0][0]; i <= sec2[1][0]; ++i )
for ( int j = sec2[0][1]; j <= sec2[1][1]; ++j )
temp[i + cutN][j] = this.arr[i][j];
// sec3 -> sec4
for ( int i = sec3[0][0]; i <= sec3[1][0]; ++i )
for ( int j = sec3[0][1]; j <= sec3[1][1]; ++j )
temp[i][j - cutM] = this.arr[i][j];
// sec4 -> sec1
for ( int i = sec4[0][0]; i <= sec4[1][0]; ++i )
for ( int j = sec4[0][1]; j <= sec4[1][1]; ++j )
temp[i - cutN][j] = this.arr[i][j];
this.arr = temp;
}
// 6. group 1 -> 4, 4 -> 3, 3 -> 2, 2 -> 1
public void six() {
int[][] temp = new int[N][M];
int cutN = N / 2, cutM = M / 2;
// sec1 -> sec4
for ( int row = 0; row < cutN; ++row )
for ( int col = 0; col < cutM; ++col )
temp[row + cutN][col] = arr[row][col];
// sec4 -> sec3
for ( int row = cutN; row < N; ++row )
for ( int col = 0; col < cutM; ++col )
temp[row][col + cutM] = arr[row][col];
// sec3 -> sec2
int row = 0;
for ( int i = cutN; i < N; ++i, ++row )
for ( int j = cutM; j < M; ++j )
temp[row][j] = arr[i][j];
// sec2 -> sec1
for ( int i = 0; i < cutN; ++i ) {
int col = 0;
for ( int j = cutM; j < M; ++j, ++col )
temp[i][col] = arr[i][j];
}
this.arr = temp;
}
// 답반환
public String getResult() {
StringBuilder sb = new StringBuilder();
for ( int[] ar1 : arr ) {
for ( int ar2 : ar1 )
sb.append( ar2 + " ");
sb.append("\n");
}
return sb.toString();
}
} // 기능 클래스 끝
// main
public static void main( String[] args ) throws Exception {
// Please Enter Your Code Here
BufferedReader br = new BufferedReader( new InputStreamReader( System.in ) );
BufferedWriter bw = new BufferedWriter( new OutputStreamWriter( System.out ) );
StringTokenizer st = new StringTokenizer( br.readLine() );
int N = Integer.parseInt( st.nextToken() );
int M = Integer.parseInt( st.nextToken() );
int R = Integer.parseInt( st.nextToken() );
int[][] arr = new int[N][];
for ( int i = 0; i < N; ++i ) arr[i] = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
Oper oper = new Oper( N, M, R, arr );
st = new StringTokenizer( br.readLine() );
for ( int i = 0; i < R; ++i ) {
int num = Integer.parseInt( st.nextToken() );
switch (num) {
case 1:
oper.one();
break;
case 2:
oper.two();
break;
case 3:
oper.three();
break;
case 4:
oper.four();
break;
case 5:
oper.five();
break;
case 6:
oper.six();
break;
}
}
bw.write( oper.getResult() );
bw.flush();
bw.close();
br.close();
}
}
|
cs |
반응형
'CS > 알고리즘_문제풀이(자바)' 카테고리의 다른 글
배열 돌리기 2 (0) | 2021.11.24 |
---|---|
배열 돌리기 1 (0) | 2021.11.23 |
1, 2, 3 더하기 4 (0) | 2021.11.19 |
팰린드롬? (0) | 2021.11.18 |
물통 (0) | 2021.11.18 |