제출 #729685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
729685		Rafi22	Cities (BOI16_cities)	C++14	0 / 100	3549 ms	254560 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;

vector<ll>DP[N][1<<K];
vector<pair<int,ll>>G[N];
int id[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<=k;i++)
    {
        cin>>a;
        id[a]=i;
    }
    for(int i=0;i<m;i++)
    {
        cin>>a>>b>>c;
        G[a].pb({b,c});
        G[b].pb({a,c});
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<(1<<k);j++)
        {
            if(j==0||(id[i]>0&&j==(1<<(id[i]-1)))) DP[i][j]=vector<ll>(sz(G[i])+1,0);
            else DP[i][j]=vector<ll>(sz(G[i])+1,infl);
        }
    }
    for(int x=1;x<(1<<k);x++)
    {
        for(int v=1;v<=n;v++)
        {
            int i=0;
            for(auto u:G[v])
            {
                i++;
                for(int y=x;;y=(y-1)&x)
                {
                    DP[v][x][i]=min(DP[v][x][i],DP[v][x^y][i-1]+DP[u.st][y].back()+u.nd);
                    if(y==0) break;
                }
            }
        }
    }
    ll ans=infl;
    for(int i=1;i<=n;i++) ans=min(ans,DP[i][(1<<k)-1].back());
    cout<<ans;
    return 0;
}

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