Submission #729718

#	Time	Username	Problem	Language	Result	Execution time	Memory
729718		Rafi22	Cities (BOI16_cities)	C++14	100 / 100	3742 ms	51980 KiB

cities

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=998244353;
int inf=1000000007;
ll infl=1000000000000000007;

const int N=100007,K=5;

ll DP[N][1<<K];
bool odw[N][1<<K];
vector<pair<int,ll>>G[N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,k,m,a,b,c;
    cin>>n>>k>>m;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<(1<<k);j++) DP[i][j]=infl;
    }
    for(int i=1;i<=k;i++)
    {
        cin>>a;
        DP[a][(1<<(i-1))]=0;
    }
    for(int i=0;i<m;i++)
    {
        cin>>a>>b>>c;
        G[a].pb({b,c});
        G[b].pb({a,c});
    }
    for(int x=1;x<(1<<k);x++)
    {
        priority_queue<pair<ll,int>>Q;
        for(int i=1;i<=n;i++) Q.push({-DP[i][x],i});
        while(sz(Q)>0)
        {
            ll t=-Q.top().st;
            int v=Q.top().nd;
            Q.pop();
            if(odw[v][x]) continue;
            odw[v][x]=1;
            for(auto u:G[v])
            {
                if(t+u.nd<DP[u.st][x])
                {
                    DP[u.st][x]=t+u.nd;
                    Q.push({-DP[u.st][x],u.st});
                }
            }
        }
        for(int v=1;v<=n;v++)
        {
            for(auto u:G[v])
            {
                int d=(1<<k)-1-x;
                for(int y=d;; y=(y-1)&d)
                {
                    DP[u.st][x^y]=min(DP[u.st][x^y],DP[v][x]+u.nd+DP[u.st][y]);
                    if(y==0) break;
                }
            }
        }
    }
    ll ans=infl;
    for(int i=1;i<=n;i++) ans=min(ans,DP[i][(1<<k)-1]);
    cout<<ans;
    return 0;
}

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