From 52e4672fbd3910802b0181075aca7e4d86010c4d Mon Sep 17 00:00:00 2001 From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com> Date: Sat, 10 Jan 2026 17:10:27 +0900 Subject: [PATCH] =?UTF-8?q?[20260110]=20BOJ=20/=20G1=20/=20=EC=86=8C=20?= =?UTF-8?q?=EC=9A=B4=EC=A0=84=ED=95=9C=EB=8B=A4.=20/=20=ED=95=9C=EC=A2=85?= =?UTF-8?q?=EC=9A=B1?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...64\354\240\204\355\225\234\353\213\244.md" | 104 ++++++++++++++++++ 1 file changed, 104 insertions(+) create mode 100644 "Ukj0ng/202601/10 BOJ G1 \354\206\214 \354\232\264\354\240\204\355\225\234\353\213\244.md" diff --git "a/Ukj0ng/202601/10 BOJ G1 \354\206\214 \354\232\264\354\240\204\355\225\234\353\213\244.md" "b/Ukj0ng/202601/10 BOJ G1 \354\206\214 \354\232\264\354\240\204\355\225\234\353\213\244.md" new file mode 100644 index 00000000..b6f0a3e9 --- /dev/null +++ "b/Ukj0ng/202601/10 BOJ G1 \354\206\214 \354\232\264\354\240\204\355\225\234\353\213\244.md" @@ -0,0 +1,104 @@ +``` +import java.io.*; +import java.util.*; + +public class Main { + private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); + private static final int INF = (int) 2e9 + 10; + private static List[] edges; + private static int[][] dist; + private static int V, E; + + public static void main(String[] args) throws IOException { + init(); + dijkstra(1); + + for (int i = 2; i <= V; i++) { + bw.write(Math.min(dist[i][0], dist[i][1]) + "\n"); + } + + bw.flush(); + bw.close(); + br.close(); + } + + private static void init() throws IOException { + StringTokenizer st = new StringTokenizer(br.readLine()); + V = Integer.parseInt(st.nextToken()); + E = Integer.parseInt(st.nextToken()); + + edges = new List[V+1]; + dist = new int[V+1][2]; + + for (int i = 1; i <= V; i++) { + edges[i] = new ArrayList<>(); + } + + for (int i = 0; i < E; i++) { + st = new StringTokenizer(br.readLine()); + int node1 = Integer.parseInt(st.nextToken()); + int node2 = Integer.parseInt(st.nextToken()); + int cost = Integer.parseInt(st.nextToken()); + int taste = Integer.parseInt(st.nextToken()); + + edges[node1].add(new Edge(node2, cost, taste)); + edges[node2].add(new Edge(node1, cost, taste)); + } + } + + private static void dijkstra(int start) { + PriorityQueue pq = new PriorityQueue<>((o1, o2) -> Integer.compare(o1.cost, o2.cost)); + for (int i = 1; i <= V; i++) { + dist[i][0] = INF; + dist[i][1] = INF; + } + dist[start][0] = 0; + pq.add(new Edge(1, 0, false)); + + while (!pq.isEmpty()) { + Edge current = pq.poll(); + + if (current.eat && current.cost > dist[current.dest][1]) continue; + if (!current.eat && current.cost > dist[current.dest][0]) continue; + + for (Edge next : edges[current.dest]) { + int nCost = current.cost + next.cost; + if (!current.eat && nCost < dist[next.dest][0]) { + dist[next.dest][0] = nCost; + pq.add(new Edge(next.dest, nCost, false)); + } + if (current.eat && nCost < dist[next.dest][1]) { + dist[next.dest][1] = nCost; + pq.add(new Edge(next.dest, nCost, true)); + } + nCost -= next.taste; + if (!current.eat && nCost < dist[next.dest][1]) { + dist[next.dest][1] = nCost; + pq.add(new Edge(next.dest, nCost, true)); + } + } + } + } + + static class Edge { + int dest; + int cost; + int taste; + boolean eat; + + public Edge(int dest, int cost, int taste) { + this.dest = dest; + this.cost = cost; + this.taste = taste; + this.eat = false; + } + + public Edge(int dest, int cost, boolean eat) { + this.dest = dest; + this.cost = cost; + this.eat = eat; + } + } +} +```