OKOJIN
solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
import java.io.*;
import java.util.*;

public class Main {
	static int N, Q;
	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st = new StringTokenizer(br.readLine());
		
		N = Integer.parseInt(st.nextToken());
		Q = Integer.parseInt(st.nextToken());
		int[] back = new int[2000];
		int backTop = -1;
		int[] forward = new int[2000];
		int forwardTop = -1;
		
		int current = -1;
		for (int c = 0; c < Q; c++) {
			st = new StringTokenizer(br.readLine());
			
			char command = st.nextToken().charAt(0);
			
			switch (command) {
				case 'B': {
					if (backTop == -1) break;
					
					forward[++forwardTop] = current;
					current = back[backTop--];
					
					break;
				}
				case 'F': {
					if (forwardTop == -1) break;
					
					back[++backTop] = current;
					current = forward[forwardTop--];
					
					break;
				}
				case 'A': {
					int number = Integer.parseInt(st.nextToken());
					
					if (current == -1) {
						current = number;
						break;
					}
					
					back[++backTop] = current;
					current = number;
					forwardTop = -1;
					
					break;
				}
				case 'C': {
					int[] newBack = new int[2000];
					int newBackTop = -1;
					
					for (int i = 0; i <= backTop; i++) {
						if (newBackTop == -1) {
							newBack[++newBackTop] = back[i];
							continue;
						}
						
						if (newBack[newBackTop] == back[i]) {
							continue;
						}
						newBack[++newBackTop] = back[i];
					}
					
					back = newBack;
					backTop = newBackTop;
					
					break;
				}
			}
		}
		
		sb.append(current).append('\n');
		if (backTop == -1) {
			sb.append(-1).append('\n');
		} else {
			for (int i = backTop; i >= 0; i--) {
				sb.append(back[i]).append(' ');
			}
			sb.append('\n');
		}
		if (forwardTop == -1) {
			sb.append(-1).append('\n');
		} else {
			for (int i = forwardTop; i >= 0; i--) {
				sb.append(forward[i]).append(' ');
			}
			sb.append('\n');
		}
		
		System.out.println(sb.toString());
	}
}