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
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 202020
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
using namespace std;
vll solve(vall3& A, ll n) {
vector<vall3> adj(n + 1);
for(ll i = 0; i < A.size(); i++) {
ll u = A[i][0], v = A[i][1], w = A[i][2];
adj[u].push_back({v,w,i + 1});
adj[v].push_back({u,w, i + 1});
}
priority_queue<all3, vall3, greater<all3>> pq;
pq.push({0, 1, -1});
vll res, vis(n + 1, 1ll<<60);
vis[1] = 0;
while(!pq.empty()) {
auto [c, u, p] = pq.top(); pq.pop();
if(vis[u] != c) continue;
if(p != -1) res.push_back(p);
for(auto& [v, w, i] : adj[u]) {
if(vis[u] + w < vis[v]) {
vis[v] = vis[u] + w;
pq.push({vis[v], v, i});
}
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll n, m;
cin>>n>>m;
vall3 A(m);
for(ll j = 0; j < m; j++) cin>>A[j][0]>>A[j][1]>>A[j][2];
auto res = solve(A, n);
for(auto& r : res) cout<<r<<' ';cout<<endl;
}
return 0;
}
|
