-
Notifications
You must be signed in to change notification settings - Fork 0
/
MinCost.java
82 lines (68 loc) · 2.09 KB
/
MinCost.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
package shortestPath;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class MinCost {
private static final int INF = 1000000001;
private static int map[][];
private static int dist[];
private static class Node implements Comparable<Node>{
int source;
public Node(int source){
this.source = source;
}
@Override
public int compareTo(Node node){
return dist[source] - dist[node.source];
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st;
int N = Integer.parseInt(br.readLine());
int M = Integer.parseInt(br.readLine());
map = new int[N + 1][N + 1];
dist = new int[N + 1];
PriorityQueue<Node> pq = new PriorityQueue<Node>();
Arrays.fill(dist, INF);
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
map[i][j] = INF;
}
}
for (int i = 0; i < M; i++) {
st = new StringTokenizer(br.readLine());
int s = Integer.parseInt(st.nextToken());
int d = Integer.parseInt(st.nextToken());
int w = Integer.parseInt(st.nextToken());
map[s][d] = Math.min(map[s][d], w);
}
st = new StringTokenizer(br.readLine());
int source = Integer.parseInt(st.nextToken());
int dest = Integer.parseInt(st.nextToken());
dist[source] = 0;
pq.add(new Node(source));
while(!pq.isEmpty()){
Node curNode = pq.poll();
if(curNode.source == dest)
break;
for(int i = 1; i <= N; i++){
if(map[curNode.source][i] < INF){
if(dist[i] > dist[curNode.source] + map[curNode.source][i]){
dist[i] = dist[curNode.source] + map[curNode.source][i];
pq.add(new Node(i));
}
}
}
}
bw.write(dist[dest] + "\n");
br.close();
bw.close();
}
}