Submission #1245789

#	Time	Username	Problem	Language	Result	Execution time	Memory
1245789		danglayloi1	Cities (BOI16_cities)	C++20	14 / 100	967 ms	111708 KiB

cities

#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
using ll = long long;
const ll mod=1e9+7;
const int nx=1e5+5;
int n, m, k, a[nx], id[nx];
vector<ii> adj[nx];
ll dp[nx][32], ans=inf;
struct dak
{
    int v;
    ll w;
    bool operator <(const dak &o)
    const
    {
        return w>o.w;
    }
};
priority_queue<dak> f[1<<5];
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n>>k>>m;
    memset(id, -1, sizeof(id));
    for(int i = 0; i < k; i++)
        cin>>a[i], id[a[i]]=i;
    while(m--)
    {
        int u, v, w;
        cin>>u>>v>>w;
        adj[u].emplace_back(v, w);
        adj[v].emplace_back(u, w);
    }
    memset(dp, 0x3f, sizeof(dp));
    for(int i = 1; i <= n; i++)
    {
        int mask=(id[i]==-1)?0:(1<<id[i]);
        dp[i][mask]=0;
        f[mask].push({i, 0});
    }
    for(int i = 0; i < (1<<k)-1; i++)
    {
        while(f[i].size())
        {
            dak v=f[i].top();
            f[i].pop();
            if(dp[v.v][i]!=v.w) continue;
            for(auto it:adj[v.v])
            {
                int nxt=i|((id[it.fi]==-1)?0:(1<<id[it.fi]));
                if(dp[it.fi][nxt]>dp[v.v][i]+it.se)
                    dp[it.fi][nxt]=dp[v.v][i]+it.se, f[nxt].push({it.fi, dp[it.fi][nxt]});
            }
            int rev=((1<<k)-1)^i;
            for(int m1 = rev; m1 > 0; m1=(m1-1)&rev)
            {
                int nxt=i|m1;
                if(dp[v.v][nxt]>dp[v.v][i]+dp[v.v][m1])
                    dp[v.v][nxt]=dp[v.v][i]+dp[v.v][m1], f[nxt].push({v.v, dp[nxt][v.v]});
            }
        }
    }
    for(int i = 1; i <= n; i++)
        ans=min(ans, dp[i][(1<<k)-1]);
    cout<<ans;
}

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