HDU - 5418：Victor and World

最新推荐文章于 2021-08-20 15:26:03 发布

Mitsuha_

最新推荐文章于 2021-08-20 15:26:03 发布

阅读量749

点赞数 1

分类专栏：状压DP 文章标签： ACM 状压DP

本文链接：https://blog.csdn.net/mitsuha_/article/details/76595565

版权

状压DP 专栏收录该内容

15 篇文章 1 订阅

订阅专栏

Victor and World

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)
Total Submission(s): 1670 Accepted Submission(s): 786

Problem Description

After trying hard for many years, Victor has finally received a pilot license. To have a celebration, he intends to buy himself an airplane and fly around the world. There are

n countries on the earth, which are numbered from

1 to

n . They are connected by

m undirected flights, detailedly the

i -th flight connects the

ui -th and the

vi -th country, and it will cost Victor's airplane

wi L fuel if Victor flies through it. And it is possible for him to fly to every country from the first country.

Victor now is at the country whose number is

1 , he wants to know the minimal amount of fuel for him to visit every country at least once and finally return to the first country.

Input

The first line of the input contains an integer

T , denoting the number of test cases.
In every test case, there are two integers

n and

m in the first line, denoting the number of the countries and the number of the flights.

Then there are

m lines, each line contains three integers

ui ,

vi and

wi , describing a flight.

1≤T≤20 .

1≤n≤16 .

1≤m≤100000 .

1≤wi≤100 .

1≤ui,vi≤n .

Output

Your program should print

T lines : the

i -th of these should contain a single integer, denoting the minimal amount of fuel for Victor to finish the travel.

Sample Input

Sample Output

思路：因为每个城市可以访问多次（至少一次），用Floyd算法求出任意两点间最短路。然后再用状压DP。

#include<bits/stdc++.h>
using namespace std;
long long d[1<<16][16],w[16][16];
int main()
{
	int T,n,m;cin>>T;
	while(T--)
	{
		cin>>n>>m;
		memset(d,0x3f3f3f3f,sizeof d);
		memset(w,0x3f3f3f3f,sizeof w);
		for(int i=0;i<n;i++)w[i][i]=0;
		while(m--)
		{
			int x,y;
			long long v;
			cin>>x>>y>>v;
			w[x-1][y-1]=w[y-1][x-1]=min(w[x-1][y-1],v);
		}
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<n;j++)
			{
				for(int k=0;k<n;k++)w[i][j]=min(w[i][j],w[i][k]+w[k][j]);
			}
		}
		d[1][0]=0;
		for(int i=1;i<(1<<n);i++)
		{
			for(int j=0;j<n;j++)
			{
				if((i&(1<<j))==0)continue;
				for(int k=0;k<n;k++)
				{
					if(i&(1<<k))continue;
					d[i|(1<<k)][k]=min(d[i|(1<<k)][k],d[i][j]+w[j][k]);
				}
			}
		}
		long long ans=1e9+7;
		for(int i=0;i<n;i++)ans=min(ans,d[(1<<n)-1][i]+w[i][0]);
		cout<<ans<<endl;
	}
	return 0;
}