제출 #1198487

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