ICPC2019南昌邀请赛 A.Attack

链接

点击跳转

里程碑

至此，
2019南昌邀请赛的题
除了D之外(页面打不开)
全部补完

题解

先用解决最小斯坦纳树的方法进行状压$dp$

然后再进行一次状压$dp$

很裸

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 50
#define maxe 2020
#define maxk 8
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct Graph
{
    int etot, head[maxn], to[maxe], next[maxe], w[maxe];
    void clear(int N)
    {
        for(int i=1;i<=N;i++)head[i]=0;
        etot=0;
    }
    void adde(int a, int b, int c=0){to[++etot]=b;w[etot]=c;next[etot]=head[a];head[a]=etot;}
    #define forp(_,__) for(auto p=__.head[_];p;p=__.next[p])
}G;
ll f[maxn][(1ll<<maxk)+10], n, m, k;
void dijkstra(ll s)
{
    priority_queue<pll,vector<pll>,greater<pll>> heap;
    ll i;
    rep(i,1,n)if(f[i][s]<linf)heap.em(pll(f[i][s],i));
    while(!heap.empty())
    {
        auto pr = heap.top(); heap.pop();
        if(pr.first!=f[pr.second][s])continue;
        forp(pr.second,G)
        {
            ll to = G.to[p];
            if(pr.first + G.w[p] < f[to][s])
            {
                f[to][s] = pr.first + G.w[p];
                heap.em( pll(f[to][s],to) );
            }
        }
    }
}
ll p[maxn], g[(1<<maxk)+10], tot, A[maxn], B[maxn], dp[(1<<4)+10];
string names[maxn];
map<string,ll> table;
int getid(string s)
{
    if(table.find(s) != table.end())return table[s];
    return table[s] = ++tot;
}
int main()
{
    ll i, j, s, sub;
    cin >> n >> m;
    k = 8;
    rep(i,1,n)cin>>names[i];
    rep(i,1,m)
    {
        string u, v; int w;
        cin >> u >> v >> w;
        G.adde(getid(u),getid(v),w);
        G.adde(getid(v),getid(u),w);
    }
    rep(i,1,n)rep(s,0,(1<<k)-1)f[i][s]=linf;
    rep(i,1,4)
    {
        string s1, s2; cin >> s1 >> s2;
        A[i] = getid(s1);
        B[i] = getid(s2);
        f[A[i]][1<<i-1]=0;
        f[B[i]][1<<i+4-1]=0;
    }
    rep(s,0,(1<<k)-1)
    {
        rep(i,1,n)
            for(sub=s&(s-1);sub;sub=s&(sub-1))
                f[i][s] = min( f[i][s], f[i][sub] + f[i][s^sub] );
        dijkstra(s);
    }
    rep(s,0,(1<<k)-1)
    {
        g[s] = linf;
        rep(i,1,n)g[s] = min(g[s],f[i][s]);
    }
    rep(i,0,(1<<4)-1)dp[i]=0;
    rep(i,0,(1<<4)-1)
    {
        ll s=0;
        rep(j,1,4)if(i&(1<<j-1))
            s = s | (1<<j-1) | (1<<j+4-1);
        dp[i] = g[s];
    }
    rep(i,0,(1<<4)-1)
    {
        for(ll j=i;j;j=(j-1)&i)
        {
            dp[i] = min( dp[i], dp[j] + dp[i^j] );
        }
    }
    printf("%lld",dp[(1<<4)-1]);
    return 0;
}