11월 4주차 공통 문제

DP/BOJ10476_좁은_미술전시관.java

@@ -0,0 +1,60 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static StringTokenizer st;
+    static final int INF = 1_000_000_000;
+
+    public static void main(String[] args) throws Exception {
+        StringBuilder sb = new StringBuilder();
+
+        while (true) {
+            st = new StringTokenizer(br.readLine());
+            int N = Integer.parseInt(st.nextToken());
+            int K = Integer.parseInt(st.nextToken());
+
+            if (N == 0 && K == 0) break;
+
+            int[][] arr = new int[N + 1][2];
+            int sum = 0;
+
+            for (int i = 1; i <= N; i++) {
+                st = new StringTokenizer(br.readLine());
+                arr[i][0] = Integer.parseInt(st.nextToken());
+                arr[i][1] = Integer.parseInt(st.nextToken());
+                sum += arr[i][0] + arr[i][1];
+            }
+
+            int[][][] dp = new int[N + 1][K + 1][3];
+
+            for (int i = 0; i <= N; i++) {
+                for (int j = 0; j <= K; j++) {
+                    for (int k = 0; k < 3; k++) {
+                        dp[i][j][k] = INF;
+                    }
+                }
+            }
+
+            dp[0][0][0] = dp[0][0][1] = dp[0][0][2] = 0;
+
+            for (int i = 1; i <= N; i++) {
+                dp[i][0][2] = 0;
+            }
+
+            for (int j = 1; j <= N; j++) {
+                for (int i = 0; i <= K; i++) {
+                    dp[j][i][2] = Math.min(dp[j - 1][i][0], Math.min(dp[j - 1][i][1], dp[j - 1][i][2]));
+                    if (i > 0) {
+                        dp[j][i][0] = Math.min(dp[j - 1][i - 1][0], dp[j - 1][i - 1][2]) + arr[j][0];
+                        dp[j][i][1] = Math.min(dp[j - 1][i - 1][1], dp[j - 1][i - 1][2]) + arr[j][1];
+                    }
+                }
+            }
+
+            int min = Math.min(dp[N][K][0], Math.min(dp[N][K][1], dp[N][K][2]));
+            System.out.print(sum - min);
+        }
+
+    }
+}

FloydWarshall/BOJ13424_비밀_모임.java

@@ -0,0 +1,87 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static StringTokenizer st;
+    static StringBuilder sb = new StringBuilder();
+
+    static int T;
+    static int N, M, K;
+    static int[][] map;
+    static final int INF = 1_000_000_000;
+    static int[] pos;
+
+    public static void main(String[] args) throws Exception {
+
+        T = Integer.parseInt(br.readLine());
+        for (int t = 0; t < T; t++) {
+            st = new StringTokenizer(br.readLine());
+            N = Integer.parseInt(st.nextToken());
+            M = Integer.parseInt(st.nextToken());
+
+            map = new int[N + 1][N + 1];
+
+            for (int i = 1; i <= N; i++) {
+                Arrays.fill(map[i], INF);
+            }
+
+            for (int i = 0; i < M; i++) {
+                st = new StringTokenizer(br.readLine());
+                int a = Integer.parseInt(st.nextToken());
+                int b = Integer.parseInt(st.nextToken());
+                int c = Integer.parseInt(st.nextToken());
+                map[a][b] = c;
+                map[b][a] = c;
+            }
+            for (int i = 1; i <= N; i++) {
+                map[i][i] = 0;
+            }
+
+            K = Integer.parseInt(br.readLine());
+            pos = new int[K];
+            st =  new StringTokenizer(br.readLine());
+            for (int i = 0; i < K; i++) {
+                pos[i] = Integer.parseInt(st.nextToken());
+            }
+
+            for (int i = 1; i <= N; i++) {
+                for (int j = 1; j <= N; j++) {
+                    for (int k = 1; k <= N; k++) {
+                        map[j][k] = Math.min(map[j][k], map[j][i] + map[i][k]);
+                    }
+                }
+            }
+
+            List<Node> list = new ArrayList<>();
+            for (int i = 1; i <= N; i++) {
+                int sum = 0;
+                for (int k = 0; k < K; k++) {
+                    sum += map[pos[k]][i];
+                }
+                list.add(new Node(i, sum));
+            }
+
+            list.sort((o1, o2) -> {
+                if (o1.sum == o2.sum) {
+                    return Integer.compare(o1.idx, o2.idx);
+                }
+                return Integer.compare(o1.sum, o2.sum);
+            });
+
+
+            sb.append(list.get(0).idx).append("\n");
+        }
+
+        System.out.println(sb);
+
+    }
+
+    static class Node{
+        int idx, sum;
+        public Node(int idx, int sum){
+            this.idx = idx;
+            this.sum = sum;
+        }
+    }
+}

Stack/BOJ4889_안정적인_문자열.java

@@ -0,0 +1,73 @@
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.Stack;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static StringTokenizer st;
+    static StringBuilder sb = new StringBuilder();
+
+
+    public static void main(String[] args) throws Exception {
+
+        int i = 1;
+        while(true){
+            String str = br.readLine();
+            if(str.charAt(0) == '-') break;
+            sb.append(i++).append(". ").append(stack(str)).append("\n");
+        }
+
+        System.out.println(sb.toString());
+    }
+
+
+    private static int stack(String str) {
+        int cnt = 0;
+        Stack<Character> stack1 = new Stack<>();
+
+        for (int i = 0; i < str.length(); i++) {
+            if(stack1.isEmpty()) {
+                stack1.push(str.charAt(i));
+                continue;
+            }
+
+            if (str.charAt(i) == '{') {
+                stack1.push(str.charAt(i));
+            } else {
+                if (stack1.peek() == '}') {
+                    stack1.push(str.charAt(i));
+                } else {
+                    stack1.pop();
+                }
+            }
+        }
+
+        while (!stack1.isEmpty()) {
+            char c1 = stack1.pop();
+            char c2 = stack1.pop();
+
+            cnt += isCnt(c1, c2);
+        }
+
+        return cnt;
+    }
+
+
+    private static int isCnt(char c1, char c2) {
+        if(c1 == '{' && c2 == '{') return 1;
+        if(c1 == '}' && c2 == '}') return 1;
+        if(c1 == '{' && c2 == '}') return 2;
+
+        return 0;
+    }
+
+}
+/**
+ * }{{{
+ * ((((
+ * ))))
+ * )(
+ *
+ */