제출 #1124005

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1124005		imarn	Cities (BOI16_cities)	C++20	0 / 100	1418 ms	40616 KiB

cities

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define szz(r) (ll)r.size()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
using namespace std;
const int mxn=1e5+5;
ll d[32][mxn]{0};
vector<pii>g[mxn];
int a[5];
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,k,m;cin>>n>>k>>m;
    for(int i=0;i<k;i++)cin>>a[i];
    for(int i=0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;
        g[a].pb({b,c});g[b].pb({a,c});
    }int x=(1<<k);
    for(int i=0;i<x;i++)for(int j=1;j<=n;j++)d[i][j]=1e16;
    for(int i=0;i<k;i++)d[(1<<i)][a[i]]=0;
    for(int msk=1;msk<x;msk++){
        priority_queue<pair<int,ll>,vector<pair<int,ll>>,greater<pair<int,ll>>>pq;
        for(int i=1;i<=n;i++){
            int msk2=msk;
            while(msk2>0){
                d[msk][i]=min(d[msk][i],d[msk^msk2][i]+d[msk2][i]);
                msk2=(msk2-1)&msk;
            }pq.push({d[msk][i],i});
        }
        while(!pq.empty()){
            auto u=pq.top();pq.pop();
            if(u.f>d[msk][u.s])continue;
            for(auto [v,w]:g[u.s]){
                if(d[msk][v]>u.f+w){
                    d[msk][v]=u.f+w;pq.push({d[msk][v],v});
                }
            }
        }
    }cout<<*min_element(d[x-1]+1,d[x-1]+n+1);
}

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