# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849110 | adhityamv | Cyberland (APIO23_cyberland) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N=100000;
vector<pair<int,double>> edges[N];
bool visited[N]={};
double ans[N];
void dfs(int u){
for(int v:edges[u]){
if(!visited[v]){
visited[v]=true;
dfs(v);
}
}
}
double solve(int n,int m,int k,int h,vector<int> x,vector<int> y,vector<int> c,vector<int> a){
for(int i=0;i<n;i++) ans[i]=-1;
for(int i=0;i<m;i++){
edges[x[i]].push_back(make_pair(y[i],(double) c[i]));
edges[y[i]].push_back(make_pair(x[i],(double) c[i]));
}
priority_queue<pair<double,int>,vector<pair<double,int>>,greater<pair<double,int>>> pq;
ans[0]=0;
visited[0]=true;
dfs(0);
pq.push(make_pair(0,0));
for(int i=0;i<n;i++){
if(a[i]==0 && visited[i]){
ans[i]=0;
pq.push(make_pair(0,i));
}
}
while(!pq.empty()){
auto u=pq.top();
pq.pop();
if(u.first!=ans[u.second]) continue;
for(auto v:edges[u.second]){
if(ans[v.first]==-1 || ans[v.first]>u.first+v.second){
ans[v.first]=u.first+v.second;
pq.push(make_pair(ans[v.first],v.first));
}
}
}
double fans=ans[h];
for(int i=0;i<n;i++){
edges[i].clear();
visited[i]=false;
ans[i]=0;
}
return fans;
}