1002

djs02027 · djs02027 · commit 3e81d56eb066 · 2022-10-02T21:40:16.000+09:00
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/BOJ/gold/BOJ12851/BOJ12851.iml b/BOJ/gold/BOJ12851/BOJ12851.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/BOJ12851/src/Main.java b/BOJ/gold/BOJ12851/src/Main.java
@@ -0,0 +1,54 @@
+import java.util.Deque;
+import java.util.LinkedList;
+import java.util.Scanner;
+
+public class Main {
+    static int TimeMin = (int) 1e9;
+    static int count=0;
+    static int [] visited;
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        int N = sc.nextInt();
+        int K = sc.nextInt();
+        visited= new int [100001];
+        BFS(N, K);
+        System.out.println(TimeMin);
+        System.out.println(count);
+    }
+
+    private static void BFS(int n, int k) {
+        Deque<int[]> dq = new LinkedList<>();
+        dq.offer(new int[]{n, 0});
+        int flag=0;
+        while (!dq.isEmpty()) {
+            int[] now = dq.pollFirst();
+            int place = now[0];
+            int time = now[1];
+            visited[place]=1;
+
+            if (place == k) {
+                if(flag==0){
+                    TimeMin = time;
+                    count++;
+                    flag=1;
+                }else if(flag==1 && TimeMin==time){
+                    count++;
+                }
+
+
+            }
+            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 + 1});
+            }
+
+
+        }
+    }
+}
