[Gold V] Title: 택배 배송, Time: 368 ms, Memory: 40032 KB -BaekjoonHub

Author: 2sojeong

백준/Gold/5972. 택배 배송/README.md

@@ -4,15 +4,15 @@
 
 ### 성능 요약
 
-메모리: 40400 KB, 시간: 392 ms
+메모리: 40032 KB, 시간: 368 ms
 
 ### 분류
 
-데이크스트라, 그래프 이론, 최단 경로
+그래프 이론, 최단 경로, 데이크스트라
 
 ### 제출 일자
 
-2025년 5월 8일 18:09:25
+2025년 5월 30일 15:31:14
 
 ### 문제 설명
 

백준/Gold/5972. 택배 배송/택배 배송.java

@@ -2,64 +2,74 @@
 import java.util.*;
 
 public class Main {
-
     private static int N,M;
-    private static int[] distance;
+    private static boolean[] visit;
+    private static int[] dis;
+
     private static class Node implements Comparable<Node>{
-        int t;
-        int weight;
+        int to;
+        int cost;
 
-        public Node(int t, int weight){
-            this.t = t;
-            this.weight = weight;
+        public Node(int to, int cost){
+            this.to = to;
+            this.cost = cost;
         }
-
-        public int compareTo(Node node){
-            return this.weight - node.weight;
+        public int compareTo(Node t){
+            return this.cost - t.cost;
         }
     }
 
-    private static ArrayList<ArrayList<Node>> graph = new ArrayList<>();
-
+    private static ArrayList<Node>[] graph;
     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());
         M = Integer.parseInt(st.nextToken());
 
-        distance = new int[N+1];
-        for(int i = 0; i < N+1; i++){
-            graph.add(new ArrayList<>());
-            distance[i] = Integer.MAX_VALUE;
+        graph = new ArrayList[N+1];
+        dis = new int[N+1];
+        visit = new boolean[N+1];
+
+        for(int i = 0; i <= N; i++){
+            graph[i] = new ArrayList<>();
+            dis[i] = Integer.MAX_VALUE;
         }
-        distance[1] = 0;
+
         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());
 
-            graph.get(a).add(new Node(b,c));
-            graph.get(b).add(new Node(a,c));
+            int from = Integer.parseInt(st.nextToken());
+            int to = Integer.parseInt(st.nextToken());
+            int cost = Integer.parseInt(st.nextToken());
+
+            graph[from].add(new Node(to,cost));
+            graph[to].add(new Node(from,cost));
         }
 
-        find();
-        System.out.print(distance[N]);
+        find(1);
+        System.out.print(dis[N]);
     }
 
-    private static void find(){
-            PriorityQueue<Node> queue = new PriorityQueue<>();
-            queue.add(new Node(1,0));
+    private static void find(int start){
+        PriorityQueue<Node> queue = new PriorityQueue<>();
+        queue.add(new Node(start,0));
+        dis[start] = 0;
+
+        while(!queue.isEmpty()){
+            Node temp = queue.poll();
 
-            while(!queue.isEmpty()){
-                Node now = queue.poll();
+            if(visit[temp.to]) continue;
+            visit[temp.to] = true;
 
-                for(Node next : graph.get(now.t)){
-                    if(distance[next.t] > distance[now.t] + next.weight){
-                        distance[next.t] = distance[now.t] + next.weight;
-                        queue.add(new Node(next.t, distance[next.t]));
-                    }
+            for(Node next : graph[temp.to]){
+                if(dis[next.to] > dis[temp.to] + next.cost){
+                    dis[next.to] = dis[temp.to] + next.cost;
+
+                    queue.add(new Node(next.to, dis[next.to]));
                 }
             }
+        }
+
     }
 }