코딩 테스트/JAVA - 백준 단계별로 풀어보기
[백준 Java] 1차원 배열 - 10811번: 바구니 뒤집기
kms152000
2025. 2. 12. 07:53
import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
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[] arr = new int[N];
for(int i = 0; i < N; i++) {
arr[i] = i + 1;
}
for(int i = 0; i < M; i++) {
st = new StringTokenizer(br.readLine());
int I = Integer.parseInt(st.nextToken());
int J = Integer.parseInt(st.nextToken());
while (I < J) {
int temp = arr[I-1];
arr[I-1] = arr[J-1];
arr[J-1] = temp;
I++;
J--;
}
}
for(int j = 0; j < N; j++) {
bw.write(arr[j] + " ");
}
br.close();
bw.flush();
bw.close();
}
}