[JAVA] 백준 25966: 배찬우는 배열을 좋아해

문제

실버 5
https://www.acmicpc.net/problem/25966

풀이

package Baekjoon;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class S5_25966 {
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    //개수 입력
    StringTokenizer st = new StringTokenizer(br.readLine());
    StringBuilder sb = new StringBuilder();
    int n = Integer.parseInt(st.nextToken()), m = Integer.parseInt(st.nextToken()), q = Integer.parseInt(st.nextToken());

    //행렬 입력
    int[][] matrix = new int[n][m];
    for (int i = 0; i < n; i++) {
      st = new StringTokenizer(br.readLine());
      for (int j = 0; j < m; j++) {
        matrix[i][j] = Integer.parseInt(st.nextToken());
      }
    }

    //쿼리 입력
    for (int c = 0; c < q; c++) {
      st = new StringTokenizer(br.readLine());
      int first = Integer.parseInt(st.nextToken());
      int i = Integer.parseInt(st.nextToken());
      int j = Integer.parseInt(st.nextToken());

      if (first == 0) {
        int k = Integer.parseInt(st.nextToken());
        matrix[i][j] = k;
      }
      else {
        int[] tmp = matrix[i];
        matrix[i] = matrix[j];
        matrix[j] = tmp;
      }
    }
    //출력
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        sb.append(matrix[i][j] + " ");
      }
      sb.append("\n");
    }
    System.out.print(sb);
  }
}

여담

배찬우씨...
계속계쏙계속 시간 초과가 떠서 열받았다...
StringBuilder의 중요성을 깨달았따....