제출 #891910

#제출 시각아이디문제언어결과실행 시간메모리
891910goodspeed0208Commuter Pass (JOI18_commuter_pass)C++14
0 / 100
2087 ms16848 KiB
#include<iostream> #include<vector> #include<algorithm> #include<set> #include<map> #include<queue> #include<utility> #define int long long #define INF 1000000000000000000 #define pii pair<long long, long long> using namespace std; struct DS{ int a, b, c; }; signed main() { int n, m, s, t, u, v; cin >> n >> m >> s >> t >> u >> v; vector<vector<pii> >G(n+1); int a, b, c; while (m--) { cin >> a >> b >> c; G[a].push_back({b, c}); G[b].push_back({a, c}); } vector<int>sdis(n+5, INF), tdis(n+5, INF), vdis(n+5, INF); sdis[s] = 0; priority_queue<pii>q; q.push({0, s}); while (!q.empty()) { auto t = q.top(); q.pop(); int len = t.first, i = t.second; if (len > sdis[i]) continue; for (auto &j : G[i]) { if (sdis[j.first] < len + j.second) continue; sdis[j.first] = len + j.second; q.push({sdis[j.first], j.first}); } } cout << sdis[1] << "\n"; //for (int i = 1 ; i <= n ; i++) cout << sdis[i] << " "; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...