제출 #1194210

#제출 시각아이디문제언어결과실행 시간메모리
1194210zh_hCyberland (APIO23_cyberland)C++17
0 / 100
16 ms5444 KiB
#include <bits/stdc++.h> #define pb push_back #define lint long long int using namespace std; double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) { vector<vector<pair<int, int>>> edge(n); for (int i = 0; i < m; i ++) { edge[x[i]].pb({y[i], c[i]}); } priority_queue<pair<int, int>> pq; vector<bool> visited(n, false); vector<int> dist(n, 1e9); dist[0] = 0; pq.push({0, 0}); while (!pq.empty()) { int v = pq.top().second; pq.pop(); if (visited[v]) continue; visited[v] = true; for (auto [vv, w] : edge[v]) { if (dist[vv] > dist[v]+w) { dist[vv] = dist[v]+w; pq.push({-dist[vv], vv}); } } } return (double)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...