본문 바로가기
Problem Solving/Baekjoon

[백준] 10811 바구니 뒤집기 - Implementation / Java

by graycode 2024. 6. 7.

 문제 링크

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

 

 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringBuilder sb = new StringBuilder();

        int[] arr = new int[read() + 1];
        for (int i = 1; i < arr.length; i++) arr[i] = i;

        int m = read();
        while (m-- > 0) {
            int i = read(), j = read();
            do {
                int k = arr[i];
                arr[i] = arr[j];
                arr[j] = k;
            } while (++i < --j);
        }

        for (int i = 1; i < arr.length; i++) sb.append(arr[i]).append(" ");

        bw.write(sb.toString());
        bw.flush();
    }

    private static int read() throws IOException {
        int c, n = System.in.read() & 15;
        while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);

        return n;
    }

}

댓글