-
Notifications
You must be signed in to change notification settings - Fork 0
/
1099.cpp
99 lines (74 loc) · 1.92 KB
/
1099.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define PI (acos(-1))
#define ct cout<<
#define cn cin>>
#define spc <<" "<<
#define nl puts("")
#define _fl(x) puts("FLAG " #x),fflush(stdout);
#define _(x) cout<< #x <<" is "<< x <<endl;
#define fs first
#define sc second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define _109 (1000000000)
#define _0(arr) memset(arr,0,sizeof ( arr ) )
#define _1(arr) memset(arr,-1,sizeof ( arr ) )
#define _ninp(n,arr) for(int i=0; i<n;i++)cin>>arr[i];
#define _nout(n,arr) for(int i=0; i<n;i++)cout<<arr[i]<<" \n"[i==n-1];
double _eps=1e-6;
vector<pair<int,int>> adj[5010];
void dijkstra(int s, vector<int> & d, vector<int> & d2,int n) {
const int INF = 1000000000;
d.assign(n, INF);
d2.assign(n, INF);
d[s] = 0;
using pii = pair<int, int>;
priority_queue<pii, vector<pii>, greater<pii>> q;
q.push({0, s});
while (!q.empty()) {
int v = q.top().second;
int d_v = q.top().first;
q.pop();
if (d2[v]<d_v)
continue;
for (auto edge : adj[v]) {
int to = edge.first;
int len = edge.second;
int dst=d_v + len;
if (dst < d[to]) {
swap(d[to] , dst);
q.push({d[to], to});
}
if(dst<d2[to] && dst!=d[to]){
d2[to]=dst;
q.push({d2[to],to});
}
}
}
}
int main() {
int T;
cn T;
for(int caseno=1; caseno<=T ;caseno++){
int n,r;
cn n>>r;
for (int i = 0; i <=n; ++i)
{
adj[i].clear();
}
for (int i = 0; i < r; ++i)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
adj[a].pb({b,c});
adj[b].pb({a,c});
}
vector<int> d1,d2;
dijkstra(1,d1,d2,n+1);
printf("Case %d: %d\n",caseno,d2[n]);
}
return 0;
}