[JSOI2013]吃货 JYY

.
.
.
.
.
分析

.
.
.
.
.
程序：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;

int n,m,tot,ans,head[20],bin[20],pin[20],g[1<<15],dist[20][20],f[1600000],deg[20],a[20];

struct edge
{
    int to,next,l;
}t[100000];

inline int read()
{
    char ch=getchar();
    int s=0,f=1;
    while (!(ch>='0'&&ch<='9')) {if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9') {s=(s<<3)+(s<<1)+ch-'0';ch=getchar();}
    return s*f;
}
void init()
{
    memset(g,0x3f3f3f3f,sizeof(g));
    memset(dist,0x3f3f3f3f,sizeof(dist));
    memset(f,0x3f3f3f3f,sizeof(f));
    for (int i=1;i<=n;i++)
		dist[i][i]=0;
    bin[0]=pin[0]=1;
    for (int i=1;i<=n;i++)
    {
    	bin[i]=bin[i-1]*2;
		pin[i]=pin[i-1]*3; 
    }
}

void add(int x,int y,int l)
{
	t[++tot].to=y;t[tot].next=head[x];t[tot].l=l;head[x]=tot;
	t[++tot].to=x;t[tot].next=head[y];t[tot].l=l;head[y]=tot;
}

void floyd()
{
    for (int k=1;k<=n;k++)
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++)
				dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
}

void pre_dp()
{
    g[0]=0;
    for (int i=0;i<bin[n];i++)
        for (int j=1;j<=n;j++)
            if (!(i&bin[j-1]))
                for (int k=j+1;k<=n;k++)
                    if (!(i&bin[k-1])) g[i^bin[j-1]^bin[k-1]]=min(g[i^bin[j-1]^bin[k-1]],g[i]+dist[j][k]);
}

void dp()
{
    queue <int> q;
    f[2]=0;
	q.push(2);
    while (!q.empty())
    {
        int s=q.front(),cnt=0;
		q.pop();
        for (int i=1;i<=n;i++)
			if (s/pin[i-1]%3>0) a[++cnt]=i;
        for (int i=1;i<=n;i++)
            if (s/pin[i-1]%3==0)
            {
                for (int j=head[i];j;j=t[j].next)
                    if (s/pin[t[j].to-1]%3>0)
                    {
                        int s1=s+pin[i-1]*2;
                        if (f[s]>=f[s1]) continue;
                        if (f[s1]==0x3f3f3f3f) q.push(s1);
                        f[s1]=f[s];
                    }
                for (int j=1;j<=cnt;j++)
                {
                    int s1=s+pin[i-1];
                    if (s/pin[a[j]-1]%3==1) s1+=pin[a[j]-1]; else s1-=pin[a[j]-1];
                    if (f[s]+dist[i][a[j]]>=f[s1]) continue;
                    if (f[s1]==0x3f3f3f3f) q.push(s1);
                    f[s1]=f[s]+dist[i][a[j]];
                }
            }
    }
}

void calc()
{
    ans=0x3f3f3f3f;
    for (int s=0;s<=pin[n]-1;s++)
    {
        int flag=0;
        for (int i=1;i<=n;i++)
			if (deg[i]&&s/pin[i-1]%3==0)
			{
				flag=1;
				break;
			}
        if (flag) continue; 
        int now=s;
        for (int i=1;i<=n;i++) 
			if (deg[i]&1)
			if (s/pin[i-1]%3==1) now+=pin[i-1]; else now-=pin[i-1];
        int s1=0;
        for (int i=1;i<=n;i++)
			if (now/pin[i-1]%3==1) s1^=bin[i-1];
        ans=min(ans,f[s]+g[s1]);
    }
    for (int i=1;i<=tot;i+=2)
		ans+=t[i].l;
}

int main()
{
    n=read();m=read();
    init();
    while (m--)
    {
        int x=read(),y=read(),l=read();
        dist[x][y]=dist[y][x]=min(dist[x][y],l);
        deg[x]++;
		deg[y]++;
        add(x,y,l);
    }    
    m=read();
    while (m--)
    {
        int x=read(),y=read(),l=read();
        dist[x][y]=dist[y][x]=min(dist[x][y],l);    
    }
    floyd();
    pre_dp();
    dp();
    calc();
    printf("%d\n",ans);
    return 0;
}