[백준] 16935번 배열 돌리기 3

https://www.acmicpc.net/problem/16935

16935번: 배열 돌리기 3

1. 전체 가로, 세로 변경해 주는 부분

2. 임시 배열의 가로, 세로 변경해 주는 부분

3. 길이의 반만 계산하는 부분

 

import java.util.*;
import java.io.*;


public class Main {

    static int N;
    static int M;
    static int[][] map;
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        N = Integer.parseInt(st.nextToken());
        M = Integer.parseInt(st.nextToken());
        int R = Integer.parseInt(st.nextToken());
        map = new int[N][M];
        for(int i = 0; i < N; i++) {
            st = new StringTokenizer(br.readLine());
            for(int j = 0; j < M; j++) {
            	map[i][j] = Integer.parseInt(st.nextToken());
            }
        }
        st = new StringTokenizer(br.readLine());
        for(int i = 0; i < R; i++) {
            int num = Integer.parseInt(st.nextToken());
            calc(num);
        }

        StringBuilder sb = new StringBuilder();
        for(int i = 0; i < map.length; i++) {
            for(int j = 0; j < map[0].length; j++) {
            	sb.append(map[i][j]).append(" ");
            }
            sb.append("\n");
        }
        System.out.println(sb);
    }

    public static void calc(int num) {
        switch(num) {
            case 1:
            	func1();
            	break;
            case 2:
                func2();
                break;
            case 3:
                func3();
                int tmp = N;
                N = M;
                M = tmp;
                break;
            case 4:
                func4();
                int tmp1 = N;
                N = M;
                M = tmp1;
                break;
            case 5:
                func5();
                break;
            case 6:
                func6();
                break;
        }
    }

    public static void func1() {
        int[][] temp = new int[N][M];
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < M; j++) {
            	temp[i][j] = map[N-1-i][j];
            }
        }
        map = temp;
    }

    public static void func2() {
        int[][] temp = new int[N][M];
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < M; j++) {
            	temp[i][j] = map[i][M-1-j];
            }
        }
        map = temp;
    }
    public static void func3() {
        int[][] temp = new int[M][N];
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < M; j++) {
            	temp[j][N-i-1] = map[i][j];
            }
        }
        map = temp;
    }
    public static void func4() {
        int[][] temp = new int[M][N];
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < M; j++) {
            	temp[M-j-1][i] = map[i][j];
            }
        }
        map = temp;
    }
    public static void func5() {
        int[][] temp = new int[N][M];
        int nMid = N / 2;
        int mMid = M / 2;
        // 1 > 2
        for(int i = 0; i < nMid; i++) {
            for(int j = 0; j < mMid; j++) {
            	temp[i][j + mMid] = map[i][j];
            } 
        }
        // 2 > 3
        for(int i = 0; i < nMid; i++) {
            for(int j = mMid; j < M; j++) {
            	temp[i + nMid][j] = map[i][j];
            } 
        }
        // 3 > 4
        for(int i = nMid; i < N; i++) {
            for(int j = mMid; j < M; j++) {
            	temp[i][j - mMid] = map[i][j];
            } 
        }
        // 4 > 1
        for(int i = nMid; i < N; i++) {
            for(int j = 0; j < mMid; j++) {
            	temp[i - nMid][j] = map[i][j];
            } 
        }
        map = temp;
    }
    public static void func6() {
        int[][] temp = new int[N][M];
        int nMid = N / 2;
        int mMid = M / 2;

        // 1 > 4
        for(int i = 0; i < nMid; i++) {
            for(int j = 0; j < M; j++) {
            	temp[i + nMid][j] = map[i][j];
            }
        }
        // 4 > 3
        for(int i=nMid; i < N; i++) {
            for(int j=0; j < mMid; j++) {
            	temp[i][j+mMid] = map[i][j];
            }
        }
        // 3 > 2
        for(int i = nMid; i <N ; i++) {
            for(int j = mMid; j < M; j++) {
            	temp[i-nMid][j] = map[i][j];
            }
        }
        // 2 > 1
        for(int i = 0; i <nMid ; i++) {
            for(int j = mMid; j < M; j++) {
            	temp[i][j-mMid] = map[i][j];
            }
        }
        map = temp;
    }
}