• 문제 링크
https://www.acmicpc.net/problem/32979
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.ArrayDeque;
import java.util.Deque;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringBuilder sb = new StringBuilder();
Deque<Integer> dq = new ArrayDeque<>();
int n = read() * 2, t = read();
while (n-- > 0) dq.offer(read());
while (t-- > 0) {
int b = read();
while (b-- > 1) dq.offer(dq.poll());
sb.append(dq.peek()).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;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 3277 DOMAINS - Data Structure / Java (0) | 2025.01.20 |
---|---|
[백준] 10209 Theseus and the Minotaur - Data Structure / Java (0) | 2025.01.19 |
[백준] 32953 회상 - Data Structure / Java (0) | 2025.01.17 |
[백준] 1408 24 - Implementation / Java (0) | 2025.01.16 |
[백준] 10988 팰린드롬인지 확인하기 - Implementation / Java (0) | 2025.01.15 |
댓글