[SWEA] 신뢰

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AXSVc1TqEAYDFAQT#none

SW Expert Academy

 

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Solution {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			st = new StringTokenizer(br.readLine());
			int n = Integer.parseInt(st.nextToken());
			Queue<String> robot = new LinkedList<>();
			Queue<Integer> orange = new LinkedList<>();
			Queue<Integer> blue = new LinkedList<>();
			for(int i=0;i<n;i++) {
				String color = st.nextToken();
				robot.offer(color);
				int x = Integer.parseInt(st.nextToken());
				if(color.equals("O")) orange.offer(x);
				else blue.offer(x);
			}
			int result = 0;
			int oP = 1;
			int bP = 1;
			while(!robot.isEmpty()) {
				boolean push = false;
				if(!orange.isEmpty()) {
					int oPos = orange.peek();
					if(oPos>oP) oP++;
					else if(oPos<oP) oP--;
					else {
						if(!push && robot.peek().equals("O")) {
							push = true;
							robot.poll();
							orange.poll();
						}
					}
				}
				if(!blue.isEmpty()) {
					int bPos = blue.peek();
					if(bPos>bP) bP++;
					else if(bPos<bP) bP--;
					else {
						if(!push && robot.peek().equals("B")) {
							push = true;
							robot.poll();
							blue.poll();
						}
					}
				}
				result++;
			}
			System.out.println("#"+tc+" "+result);
		}
	}
}