本来以为完全图匹配有什么高深的算法 结果去看参考资料里的论文就是带花树 汗
这道题n小 状压每个点的奇偶性
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int N=18;
int n,m;
int dis[N][N];
int f[1<<N],deg[N];
int lst[N],pnt;
int main(){
int iu,iv,iw,tem;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
while (1){
read(n); if (!n) break;
for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) dis[i][j]=1<<29;
for (int i=1;i<=n;i++) dis[i][i]=0,deg[i]=0;
read(m);
tem=0;
for (int i=1;i<=m;i++)
read(iu),read(iv),read(iw),deg[iu]^=1,deg[iv]^=1,tem+=iw,dis[iu][iv]=min(dis[iu][iv],iw),dis[iv][iu]=min(dis[iv][iu],iw);
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
for (int i=0;i<(1<<n);i++) f[i]=1<<30;
int s=0;
for (int i=1;i<=n;i++) s+=deg[i]*(1<<(i-1));
f[s]=tem;
for (int i=s;i;i--){
if (f[i]==1<<30) continue;
pnt=0;
for (int j=1;j<=n;j++) if (i>>(j-1)&1) lst[++pnt]=j;
for (int j=1;j<=pnt;j++)
for (int k=j+1;k<=pnt;k++){
s=i^(1<<(lst[j]-1))^(1<<(lst[k]-1));
f[s]=min(f[s],f[i]+dis[lst[j]][lst[k]]);
}
}
printf("%d\n",f[0]);
}
return 0;
}