제출 #940108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
940108		Darren0724	Cities (BOI16_cities)	C++17	14 / 100	256 ms	47568 KiB

cities

#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long 
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;
int n,k,m;
vector<int> s;
vector<pair<int,int>> adj[N];
vector dis(4,vector<int>(N,INF));
void dijk(int s,vector<int> &dis){
    dis[s]=0;
    priority_queue<pair<int,int>> pq;
    pq.push({0,s});
    while(pq.size()){
        auto [dis1,a]=pq.top();
        pq.pop();
        dis1=-dis1;
        if(dis1!=dis[a])continue;
        for(auto [c,d]:adj[a]){
            int cost=dis1+d;
            if(dis[c]>cost){
                dis[c]=cost;
                pq.push({-dis[c],c});
            }
        }
    }
}
int32_t main() {
    LCBorz;
    cin>>n>>k>>m;    
    for(int i=0;i<k;i++){
        int p;cin>>p;
        s.push_back(p);
    }
    for(int i=0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }
    for(int i=0;i<k;i++){
        dijk(s[i],dis[i]);
    }
    int ans=INF;
    for(int i=1;i<=n;i++){
        int cost=0;
        for(int j=0;j<k;j++){
            cost+=dis[j][i];
        }
        ans=min(ans,cost);
    }
    cout<<ans<<endl;

    return 0;
}

• Subtask 1: 0 / 22
• Subtask 2: 14 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 26