Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
82 changes: 82 additions & 0 deletions JHLEE325/202507/18 BOJ G5 톱니바퀴.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,82 @@
```java
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class Main {

static List<Deque<Integer>> wheel = new ArrayList<>();

public static void rotate(int idx, int dir) {
if (dir == 1) {
int last = wheel.get(idx).pollLast();
wheel.get(idx).addFirst(last);
} else {
int first = wheel.get(idx).pollFirst();
wheel.get(idx).addLast(first);
}
}

public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;

for (int i = 0; i < 4; i++) {
String line = br.readLine();
Deque<Integer> dq = new LinkedList<>();
for (char c : line.toCharArray()) {
dq.add(c - '0');
}
wheel.add(dq);
}

int k = Integer.parseInt(br.readLine());

for (int i = 0; i < k; i++) {
st = new StringTokenizer(br.readLine());
int num = Integer.parseInt(st.nextToken()) - 1;
int dir = Integer.parseInt(st.nextToken());

int[] dirs = new int[4];
dirs[num] = dir;

// 왼쪽
for (int j = num; j > 0; j--) {
int left = ((LinkedList<Integer>) wheel.get(j - 1)).get(2);
int right = ((LinkedList<Integer>) wheel.get(j)).get(6);
if (left != right) {
dirs[j - 1] = -dirs[j];
} else {
break;
}
}

// 오른쪽
for (int j = num; j < 3; j++) {
int left = ((LinkedList<Integer>) wheel.get(j)).get(2);
int right = ((LinkedList<Integer>) wheel.get(j + 1)).get(6);
if (left != right) {
dirs[j + 1] = -dirs[j];
} else {
break;
}
}

for (int j = 0; j < 4; j++) {
if (dirs[j] != 0) {
rotate(j, dirs[j]);
}
}
}

int score = 0;
for (int i = 0; i < 4; i++) {
if (wheel.get(i).peekFirst() == 1) {
score += (1 << i);
}
}
System.out.println(score);
}
}

```