1003

djs02027 · djs02027 · commit 7823f2d0496e · 2022-10-04T14:37:24.000+09:00
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/BOJ/gold/BOJ13549/BOJ13549.iml b/BOJ/gold/BOJ13549/BOJ13549.iml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
diff --git a/BOJ/gold/BOJ13549/src/Main.java b/BOJ/gold/BOJ13549/src/Main.java
@@ -0,0 +1,45 @@
+import java.util.Deque;
+import java.util.LinkedList;
+import java.util.Scanner;
+
+public class Main {
+    static int[] visited;
+    static int minTime = (int) 1e9;
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        visited = new int[100001];
+
+        int N = scanner.nextInt();
+        int K = scanner.nextInt();
+
+        BFS(N, K);
+        System.out.println(minTime);
+    }
+
+    private static void BFS(int n, int k) {
+        Deque<int[]> dq = new LinkedList<>();
+        dq.offer(new int[]{n, 0});
+        while (!dq.isEmpty()) {
+            int[] now = dq.pollFirst();
+            int place = now[0];
+            int time = now[1];
+            visited[place] = 1;
+            if (place == k) {
+                minTime = Math.min(minTime, time);
+
+            }
+            if(0<=place-1&& visited[place-1]==0){
+                dq.offer(new int[]{place-1, time+1});
+            }
+            if(place+1<100001 && visited[place+1]==0){
+                dq.offer(new int[]{place+1, time+1});
+            }
+            if(place*2<100001 && visited[place*2]==0){
+                dq.offer(new int[]{place*2, time});
+            }
+
+        }
+
+    }
+}
diff --git a/BOJ/gold/BOJ13913/BOJ13913.iml b/BOJ/gold/BOJ13913/BOJ13913.iml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
diff --git a/BOJ/gold/BOJ13913/src/Main.java b/BOJ/gold/BOJ13913/src/Main.java
@@ -0,0 +1,59 @@
+import java.util.*;
+
+public class Main {
+    static  int [] visited;
+
+    static  ArrayList<Integer> result;
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        int N = sc.nextInt();
+        int K = sc.nextInt();
+        visited = new  int [100001];
+        Arrays.fill(visited, -1);
+        result=new ArrayList<>();
+        int time = BFS(N,K);
+        System.out.println(time);
+        for(int i= result.size()-1; i>=0; i--){
+            System.out.print(result.get(i)+" ");
+        }
+    }
+
+    private static int BFS(int n, int k) {
+        Deque<int []> dq = new LinkedList<>();
+        dq.offer(new int []{n,0});
+        visited[n]=n;
+        while (!dq.isEmpty()){
+            int [] now = dq.pollFirst();
+            int place = now[0];
+            int time = now[1];
+
+            if (place==k){
+                int idx =place;
+                while (idx!=n){
+                    if(idx == n){
+                        break;
+                    }
+                    result.add(idx);
+                    idx=visited[idx];
+                }
+                result.add(n);
+                return time;
+
+            }
+            if (0<=place-1&& visited[place-1]==-1){
+                dq.offer(new int []{place-1,time+1});
+                visited[place-1]=place;
+            }
+            if (place+1<100001 && visited[place+1]==-1){
+                dq.offer(new int []{place+1,time+1});
+                visited[place+1]=place;
+            }
+            if(place*2<100001 && visited[place*2]==-1){
+                dq.offer(new int []{place*2,time+1});
+                visited[place*2]=place;
+            }
+        }
+        return n;
+    }
+}
