-
Notifications
You must be signed in to change notification settings - Fork 1
/
13. Flight Routes.cpp
72 lines (66 loc) · 1.7 KB
/
13. Flight Routes.cpp
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
// Using 2D distance vector in Dijsktra.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define int64 int64_t
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define str string
#define ri(x) int x;cin>>x;
#define rl(x) ll x; cin>>x;
#define rs(x) str x; cin>>x;
#define rd(x) d x; cin>>x;
#define w(x) cout<<x;
#define vec(x) std::vector<x>
#define nl '\n'
#define all(x) x.begin(),x.end()
#define map_traverse(it,x) for(auto it = BN(x); it!= ED(x); it++)
#define debug(x) for(auto y : x) {cout<<y<<" ";} cout<<nl;
#define PI 3.14159265358979323846264338327950L
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
const unsigned int M = 1000000007;
const int mxN=2e5;
// const int N = 100031;
bool bad = false;
vector<pii>monster;
int n,m,k;
const ll inf = INT_MAX;
pii start; pii ending;
int dx[4] = {0,-1,1,0};
int dy[4] = {1,0,0,-1};
string path = "RUDL";
const int N = 505;
// int dis[N][N];
// vi adj[mxN],adj2[2505];
vector<int> dis1[mxN]; int dis2[mxN];
bool vis[2505],vis2[2505];
vi par(mxN,0);
vector<pii>adj[mxN],adj2[mxN];
void solve(){
cin>>n>>m>>k;
rep(i,0,m){
int a,b,w; cin>>a>>b>>w;
adj[a].pb({b,w});
}
priority_queue<pii,vector<pii>,greater<pii>>q;
q.push({0,1});
while(!q.empty()){
auto p = q.top(); q.pop();
if(dis1[p.second].size()>=k)continue;
dis1[p.second].pb(p.first);
for(auto x: adj[p.second]){
q.push({p.first+x.second,x.first});
}
}
for(int i=0;i<k;i++){
cout<<dis1[n][i]<<" ";
}
}
signed main(){
IOS;
solve();
}