Submission #1198498

#TimeUsernameProblemLanguageResultExecution timeMemory
1198498zh_hCyberland (APIO23_cyberland)C++17
15 / 100
20 ms6724 KiB
#include<bits/stdc++.h> #define pb push_back 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, double>>> edge(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<double, int>> pq; pq.push({0, 0}); vector<bool> visited(N, false); vector<double> dist(N, 1e19); dist[0] = 0; while (!pq.empty()) { int v = pq.top().second; pq.pop(); if (visited[v]) continue; visited[v] = true; for (auto [u, w] : edge[v]) { if (dist[v] + w < dist[u]) { dist[u] = dist[v] + w; pq.push({-dist[u], u}); } } } if (dist[H] == 1e19) {return (double)-1;} 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...