제출 #1196221

#제출 시각아이디문제언어결과실행 시간메모리
1196221GoBananas69Cyberland (APIO23_cyberland)C++20
0 / 100
65 ms5444 KiB
#include <algorithm> #include <iostream> #include <vector> #include <queue> #include <utility> using std::vector; using std::pair; using std::priority_queue; vector<vector<pair<int, int>>> adj; int dijkstra(int s, int h) { int n = adj.size(); vector<int> dist(n, 1e9); vector<bool> vis(n, false); dist[s] = 0; priority_queue<pair<int, int>, vector<pair<int, int>>, std::greater<pair<int, int>>> pq; pq.push({0, s}); while (!pq.empty()) { int u = pq.top().second; pq.pop(); if (vis[u]) continue; vis[u] = true; for (auto &p: adj[u]) { int v = p.first; int w = p.second; if (dist[v] > dist[u] + w) { dist[v] = dist[u] + w; pq.push({dist[v], v}); } } } return dist[h]; } double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) { adj.resize(n); for (int i = 0; i<m; ++i) { int u = x[i], v = y[i], w = c[i]; adj[u].push_back({v, w}); adj[v].push_back({u, w}); } return dijkstra(0, h); // return dist[h]; } // int main() { // int res = solve(3, 1, {-1, 0, 0}, {{1, 2}}); // cout << res << '\n'; // }
#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...