19:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1c:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1a:T410,#include using namespace std; int main() { int n, m; cin >> n >> m; vector>> adj(n + 1); for (int i = 0; i < m; i++) { int x, y; long long c; cin >> x >> y >> c; adj[x].push_back({y, c}); adj[y].push_back({x, c}); } int a, b; cin >> a >> b; const long long INF = (long long)4e18; vector dist(n + 1, INF), hops(n + 1, INF); priority_queue, vector>, greater<>> pq; dist[a] = 0; hops[a] = 0; pq.push({0, 0, a}); while (!pq.empty()) { auto [d, h, u] = pq.top(); pq.pop(); if (d > dist[u] || (d == dist[u] && h > hops[u])) continue; for (auto& [v, w] : adj[u]) { long long nd = d + w, nh = h + 1; if (nd < dist[v] || (nd == dist[v] && nh < hops[v])) { dist[v] = nd; hops[v] = nh; pq.push({nd, nh, v}); } } } cout << (dist[b] == INF ? -1 : hops[b]) << "\n"; return 0; } 1b:T410,#include using namespace std; int main() { int n, m; cin >> n >> m; vector>> adj(n + 1); for (int i = 0; i < m; i++) { int x, y; long long c; cin >> x >> y >> c; adj[x].push_back({y, c}); adj[y].push_back({x, c}); } int a, b; cin >> a >> b; const long long INF = (long long)4e18; vector dist(n + 1, INF), hops(n + 1, INF); priority_queue, vector>, greater<>> pq; dist[a] = 0; hops[a] = 0; pq.push({0, 0, a}); while (!pq.empty()) { auto [d, h, u] = pq.top(); pq.pop(); if (d > dist[u] || (d == dist[u] && h > hops[u])) continue; for (auto& [v, w] : adj[u]) { long long nd = d + w, nh = h + 1; if (nd < dist[v] || (nd == dist[v] && nh < hops[v])) { dist[v] = nd; hops[v] = nh; pq.push({nd, nh, v}); } } } cout << (dist[b] == INF ? -1 : hops[b]) << "\n"; return 0; }