Submission #1326583

#TimeUsernameProblemLanguageResultExecution timeMemory
1326583eri16Cyberland (APIO23_cyberland)C++20
15 / 100
68 ms33360 KiB
#include <bits/stdc++.h> #include "cyberland.h" 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){ priority_queue< pair<double,int>, vector<pair<double,int>>, greater<pair<double,int>> > pq; pq.push({0,0}); vector<pair<int,double>> adj[N]; 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]}); } vector<bool> vis(N, false); while(!pq.empty()){ auto [d,u]=pq.top(); pq.pop(); vis[u]=true; if(u==H){return d;} for(auto [v,t] : adj[u]){ if(!vis[v]){ if(arr[v]==0)pq.push({0,v}); else pq.push({d+t,v}); } } } return -1; }
#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...