제출 #849104

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
849104		adhityamv	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	32 ms	8668 KiB

cyberland

#include <bits/stdc++.h>
using namespace std;
const int N=100000;
vector<pair<int,double>> edges[N];
bool visited[N]={};
double ans[N];
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;
    pq.push(make_pair(0,0));
    for(int i=0;i<n;i++){
        if(a[i]==0){
            ans[i]=0;
            pq.push(make_pair(0,i));
        }
    }
    while(!pq.empty()){
        auto u=pq.top();
        pq.pop();
        for(auto v:edges[u.second]){
            if(ans[v.first]==-1 || ans[v.first]>u.first+v.second){
                ans[v.first]=ans[u.second]+v.second;
                pq.push(make_pair(ans[v.first],v.first));
            }
        }
    }
    int fans=ans[h];
    for(int i=0;i<n;i++){
        edges[i].clear();
        visited[i]=false;
        ans[i]=0;
    }
    return fans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3