-
Notifications
You must be signed in to change notification settings - Fork 2
/
Alex Travelling.cc
90 lines (73 loc) · 2.17 KB
/
Alex Travelling.cc
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
83
84
85
86
87
88
89
90
//{ Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution {
public:
int minimumCost(vector<vector<int>>& flights, int n, int k) {
// code here
vector<vector<vector<int>>> graph(n+1);
for(int i = 0 ; i < flights.size(); ++i) {
int u = flights[i][0];
int v = flights[i][1];
int w = flights[i][2];
graph[u].push_back({v,w});
}
vector<int> dist(n+1, -1);
queue<vector<int>> q;
dist[k] = 0;
q.push({k,dist[k]}); /* Node | cost */
int ans = INT_MIN;
while(!q.empty()) {
vector<int> frontNode = q.front();
q.pop();
int node = frontNode[0];
int cost = frontNode[1];
for(auto x: graph[node]) {
int node_x = x[0];
int cost_x = x[1];
if(dist[node_x] == -1) {
dist[node_x] = cost + cost_x;
q.push({node_x, dist[node_x]});
}
else if(dist[node_x] > cost + cost_x) {
dist[node_x] = cost + cost_x;
q.push({node_x, dist[node_x]});
}
}
}
for(int i = 1 ; i < dist.size(); ++i) {
if(dist[i] != -1) {
ans = max(ans, dist[i]);
}
else return -1;
}
return ans;
}
};
//{ Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int size;
cin >> size;
vector<vector<int>> flights(size,vector<int>(3));
for (int i = 0; i < size; i++) {
vector<int> temp;
for (int j = 0; j < 3; ++j) {
int x;
cin >> x;
temp.push_back(x);
}
flights[i]=temp;
}
Solution ob;
cout << ob.minimumCost(flights, n, k) << "\n";
}
}
// } Driver Code Ends