Merge pull request #204 from JavaCote/sangeok

이상억 35주차

Author: leesangeok

week35/이상억/backjoon/근손실.java

@@ -0,0 +1,46 @@
+import java.util.*;
+import java.io.*;
+
+public class Main {
+
+    static int N, K;
+    static int[] A;
+    static boolean[] used;
+    static int count = 0;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        K = Integer.parseInt(st.nextToken());
+
+        A = new int[N];
+        used = new boolean[N];
+
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+            A[i] = Integer.parseInt(st.nextToken());
+        }
+
+        dfs(0, 500);
+        System.out.println(count);
+    }
+
+    static void dfs(int day, int weight) {
+        if (weight < 500) return;
+
+        if (day == N) {
+            count++;
+            return;
+        }
+
+        for (int i = 0; i < N; i++) {
+            if (!used[i]) {
+                used[i] = true;
+                dfs(day + 1, weight + A[i] - K);
+                used[i] = false;
+            }
+        }
+    }
+}

week35/이상억/backjoon/돌게임nm.java

@@ -0,0 +1,25 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+
+        int T = Integer.parseInt(br.readLine());
+
+        for (int i = 0; i < T; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            long n = Long.parseLong(st.nextToken());
+            long m = Long.parseLong(st.nextToken());
+
+            if (n >= 2 && m >= 2 && (n % 2 == m % 2)) {
+                sb.append("NO\n");
+            } else {
+                sb.append("YES\n");
+            }
+        }
+
+        System.out.print(sb);
+    }
+}

week35/이상억/backjoon/서강그라운드.java

@@ -0,0 +1,96 @@
+import java.util.*;
+import java.io.*;
+
+public class Main {
+
+    static class Edge {
+        int to;
+        int cost;
+        Edge(int to, int cost){
+            this.to = to;
+            this.cost = cost;
+        }
+    }
+
+    static int n, m, r;
+    static int[] items;
+    static List<Edge>[] graph;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+
+        st = new StringTokenizer(br.readLine());
+        n = Integer.parseInt(st.nextToken()); // 지역 개수
+        m = Integer.parseInt(st.nextToken()); // 수색 범위
+        r = Integer.parseInt(st.nextToken()); // 길 개수
+
+        items = new int[n + 1];
+
+        st = new StringTokenizer(br.readLine());
+        for (int i = 1; i <= n; i++) {
+            items[i] = Integer.parseInt(st.nextToken());
+        }
+
+        graph = new ArrayList[n + 1];
+        for (int i = 1; i <= n; i++) {
+            graph[i] = new ArrayList<>();
+        }
+
+        for (int i = 0; i < r; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            int l = Integer.parseInt(st.nextToken());
+
+            graph[a].add(new Edge(b, l));
+            graph[b].add(new Edge(a, l));
+        }
+
+        int answer = 0;
+
+        // 모든 지역을 시작점으로 다익스트라
+        for (int i = 1; i <= n; i++) {
+            answer = Math.max(answer, dijkstra(i));
+        }
+
+        System.out.println(answer);
+    }
+
+    static int dijkstra(int start) {
+        int[] dist = new int[n + 1];
+        Arrays.fill(dist, Integer.MAX_VALUE);
+        dist[start] = 0;
+
+        PriorityQueue<int[]> pq =
+                new PriorityQueue<>((a, b) -> Integer.compare(a[1], b[1]));
+
+        pq.add(new int[]{start, 0});
+
+        while (!pq.isEmpty()) {
+            int[] cur = pq.poll();
+            int now = cur[0];
+            int cost = cur[1];
+
+            if (cost > dist[now]) continue;
+
+            for (Edge e : graph[now]) {
+                int next = e.to;
+                int nextCost = cost + e.cost;
+
+                if (nextCost < dist[next]) {
+                    dist[next] = nextCost;
+                    pq.add(new int[]{next, nextCost});
+                }
+            }
+        }
+
+        int sum = 0;
+        for (int i = 1; i <= n; i++) {
+            if (dist[i] <= m) {
+                sum += items[i];
+            }
+        }
+        return sum;
+    }
+}

week35/이상억/backjoon/적록색약.java

@@ -0,0 +1,88 @@
+import java.util.*;
+import java.io.*;
+
+public class Main {
+
+    static int N;
+    static char[][] map;
+    static boolean[][] visited;
+
+    static int[] dx = {-1, 1, 0, 0};
+    static int[] dy = {0, 0, -1, 1};
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        N = Integer.parseInt(br.readLine());
+        map = new char[N][N];
+
+        for (int i = 0; i < N; i++) {
+            String line = br.readLine();
+            for (int j = 0; j < N; j++) {
+                map[i][j] = line.charAt(j);
+            }
+        }
+
+        // 일반 시야
+        visited = new boolean[N][N];
+        int normal = 0;
+
+        for (int i = 0; i < N; i++) {
+            for (int j = 0; j < N; j++) {
+                if (!visited[i][j]) {
+                    bfs(i, j, false);
+                    normal++;
+                }
+            }
+        }
+
+        // 적록색약
+        visited = new boolean[N][N];
+        int blind = 0;
+
+        for (int i = 0; i < N; i++) {
+            for (int j = 0; j < N; j++) {
+                if (!visited[i][j]) {
+                    bfs(i, j, true);
+                    blind++;
+                }
+            }
+        }
+
+        System.out.println(normal + " " + blind);
+    }
+
+    static void bfs(int x, int y, boolean colorblind) {
+        Queue<int[]> q = new LinkedList<>();
+        q.add(new int[]{x, y});
+        visited[x][y] = true;
+
+        char start = map[x][y];
+
+        while (!q.isEmpty()) {
+            int[] cur = q.poll();
+
+            for (int d = 0; d < 4; d++) {
+                int nx = cur[0] + dx[d];
+                int ny = cur[1] + dy[d];
+
+                if (nx < 0 || ny < 0 || nx >= N || ny >= N) continue;
+                if (visited[nx][ny]) continue;
+
+                char next = map[nx][ny];
+
+                if (sameColor(start, next, colorblind)) {
+                    visited[nx][ny] = true;
+                    q.add(new int[]{nx, ny});
+                }
+            }
+        }
+    }
+
+    static boolean sameColor(char a, char b, boolean blind) {
+        if (!blind) return a == b;
+
+        if (a == 'B' || b == 'B') return a == b;
+        return true;
+    }
+}