Submission #967068

#TimeUsernameProblemLanguageResultExecution timeMemory
967068akacool445kCyberland (APIO23_cyberland)C++17
0 / 100
3040 ms7632 KiB
#include <bits/stdc++.h> #include "cyberland.h" using namespace std; // #define int long long #define ff first #define ss second const int shrek = 1e5; vector< vector<pair<int, int>>> adj(shrek); double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) { vector<int> dist (n); for(int i = 0; i < n; i++) dist[i] = -1; for(int i = 0; i < m; i++) { adj[x[i]].push_back({y[i], c[i]}); adj[y[i]].push_back({x[i], c[i]}); } priority_queue <pair<double, int>> q; q.push({0, 0}); while(!q.empty()) { double d = -q.top().ff; int u = q.top().ss; q.pop(); if(dist[u] != -1) continue; dist[u] = d; for(auto x : adj[u]) { q.push({-(d + x.ss), x.ff}); } } double ans = dist[h]; return ans; }
#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...