solved 탈출 - 14352KB 104ms

Baekjoon/탈출/탈출_김현준.java

@@ -0,0 +1,86 @@
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class 탈출 {
+    static class Point {
+        int r, c, move;
+        Point(int r, int c, int move) {
+            this.r = r;
+            this.c = c;
+            this.move = move;
+        }
+    }
+    static char[][] map;
+    static int N, M;
+    static int[] dr = {-1, 0, 1, 0};
+    static int[] dc = {0, 1, 0, -1};
+    static Queue<Point> water = new ArrayDeque<>();
+    static Queue<Point> moves = new ArrayDeque<>();
+    static StringTokenizer st;
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+        int r = 0, c = 0;
+        map = new char[N][M];
+        for(int i=0;i<N;i++) {
+            String line = br.readLine();
+            for(int j=0;j<M;j++) {
+                map[i][j] = line.charAt(j);
+                if(map[i][j] == '*') water.offer(new Point(i, j, 0)); // 물
+                else if(map[i][j] == 'S') moves.offer(new Point(i, j, 0)); // 고슴도치 위치
+                else if(map[i][j] == 'D') {
+                    r = i; c = j;
+                }
+            }
+        }
+
+        // 불필요한 게산할 필요 없이, 물 먼저 채우고 고슴도치 이동
+        int cnt = 0;
+        while(!moves.isEmpty()) {
+            int size = water.size();
+            for(int i=0;i<size;i++) {
+                Point w = water.poll();
+                for(int k=0;k<4;k++) {
+                    int wr = w.r + dr[k];
+                    int wc = w.c + dc[k];
+                    if(inRange(wr, wc) && map[wr][wc] == '.') {
+                        map[wr][wc] = '*';
+                        water.offer(new Point(wr, wc, 0));
+                    }
+                }
+            }
+
+            int moveSize = moves.size();
+            for(int i=0;i<moveSize;i++) {
+                Point p = moves.poll();
+                for(int k=0;k<4;k++) {
+                    int nr = p.r + dr[k];
+                    int nc = p.c + dc[k];
+                    if(inRange(nr, nc) && map[nr][nc] == '.') {
+                        map[nr][nc] = 'S';
+                        moves.offer(new Point(nr, nc, p.move + 1));
+                    } else if(inRange(nr, nc) && map[nr][nc] == 'D') {
+                        map[nr][nc] = 'S';
+                        cnt = p.move + 1;
+                        break;
+                    }
+                }
+            }
+        }
+
+        if(map[r][c] == 'D') {
+            System.out.println("KAKTUS");
+        } else {
+            System.out.println(cnt);
+        }
+    }
+
+    public static boolean inRange(int r, int c) {
+        return r >= 0 && r < N && c >= 0 && c < M;
+    }
+}

Programmers/불량사용자/불량사용자_김현준.java

@@ -0,0 +1,54 @@
+import java.util.*;
+
+class Solution {
+    static List<Set<String>> firstSet = new ArrayList<>();
+    static Set<Set<String>> finalSet = new HashSet<>();
+    static int ans = 0;
+    static boolean[] v;
+    public int solution(String[] user_id, String[] banned_id) {
+        int answer = 1;
+        // 가능한 모든 경우를 탐색
+        for(int i=0;i<banned_id.length;i++) {
+            char[] c = banned_id[i].toCharArray();
+            Set<String> set = new HashSet<>();
+            for(int j=0;j<user_id.length;j++) {
+                int cnt = 0;
+                for(int k=0;k<user_id[j].length();k++) {
+                    // k 가 banned_id 보다 갯수가 많으면 x
+                    if(k > c.length - 1) break;
+                    if(c[k] == '*' || c[k] == user_id[j].charAt(k)) {
+                        cnt++;
+                    }
+
+                    if(cnt == c.length && k == user_id[j].length()-1) {
+                        set.add(user_id[j]);
+                    }
+                }
+            }
+            firstSet.add(set);
+        }
+
+        System.out.println(firstSet.toString());
+        // 여기서 dfs로 순서 상관없이 조회가능한 갯수 체크
+        // v = new boolean[set.size()];
+        dfs(0, new HashSet<>(), banned_id.length);
+        // System.out.println(finalSet.toString());
+        return finalSet.size();
+    }
+
+    public static void dfs(int idx, Set<String> current, int size) {
+        // basis
+        if(idx == size) {
+            finalSet.add(new HashSet<>(current));
+            return;
+        }
+
+        for(String user : firstSet.get(idx)) {
+            if(!current.contains(user)) {
+                current.add(user);
+                dfs(idx + 1, current, size);
+                current.remove(user);
+            }
+        }
+    }
+}