Submission #985074

#TimeUsernameProblemLanguageResultExecution timeMemory
985074reverberationCyberland (APIO23_cyberland)C++17
0 / 100
24 ms6744 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll, ll> #define fs first #define sc second #define pb push_back double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> v) { vector<vector<pll>> g(n + 1); for (ll i = 0; i < m; i++) { ll a = x[i] + 1, b = y[i] + 1, cost = c[i]; g[a].pb({b, cost}); g[b].pb({a, cost}); } vector<ll> dist(n + 1, 1e9 + 10); dist[1] = 0; priority_queue<pll, vector<pll>, greater<pll>> q; q.push({0, 1}); while (!q.empty()) { auto [curcost, v] = q.top(); q.pop(); if (curcost != dist[v]) continue; for (auto [to, cost] : g[v]) { if (dist[to] > dist[v] + cost) { dist[to] = dist[v] + cost; q.push({dist[to], to}); } } } return dist[h]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...