POJ2686_Traveling by Stagecoach_状压DP

Traveling by Stagecoach

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 3357		Accepted: 1295		Special Judge

Description

Once upon a time, there was a traveler. 

He plans to travel using stagecoaches (horse wagons). His starting point and destination are fixed, but he cannot determine his route. Your job in this problem is to write a program which determines the route for him. 

There are several cities in the country, and a road network connecting them. If there is a road between two cities, one can travel by a stagecoach from one of them to the other. A coach ticket is needed for a coach ride. The number of horses is specified in each of the tickets. Of course, with more horses, the coach runs faster. 

At the starting point, the traveler has a number of coach tickets. By considering these tickets and the information on the road network, you should find the best possible route that takes him to the destination in the shortest time. The usage of coach tickets should be taken into account. 

The following conditions are assumed. 

• A coach ride takes the traveler from one city to another directly connected by a road. In other words, on each arrival to a city, he must change the coach. 
  
• Only one ticket can be used for a coach ride between two cities directly connected by a road. 
  
• Each ticket can be used only once. 
  
• The time needed for a coach ride is the distance between two cities divided by the number of horses. 
  
• The time needed for the coach change should be ignored.

Input

The input consists of multiple datasets, each in the following format. The last dataset is followed by a line containing five zeros (separated by a space). 

n m p a b 
t1 t2 ... tn 
x1 y1 z1 
x2 y2 z2 
... 
xp yp zp 

Every input item in a dataset is a non-negative integer. If a line contains two or more input items, they are separated by a space. 

n is the number of coach tickets. You can assume that the number of tickets is between 1 and 8. m is the number of cities in the network. You can assume that the number of cities is between 2 and 30. p is the number of roads between cities, which may be zero. 

a is the city index of the starting city. b is the city index of the destination city. a is not equal to b. You can assume that all city indices in a dataset (including the above two) are between 1 and m. 

The second line of a dataset gives the details of coach tickets. ti is the number of horses specified in the i-th coach ticket (1<=i<=n). You can assume that the number of horses is between 1 and 10. 

The following p lines give the details of roads between cities. The i-th road connects two cities with city indices xi and yi, and has a distance zi (1<=i<=p). You can assume that the distance is between 1 and 100. 

No two roads connect the same pair of cities. A road never connects a city with itself. Each road can be traveled in both directions.

Output

For each dataset in the input, one line should be output as specified below. An output line should not contain extra characters such as spaces. 

If the traveler can reach the destination, the time needed for the best route (a route with the shortest time) should be printed. The answer should not have an error greater than 0.001. You may output any number of digits after the decimal point, provided that the above accuracy condition is satisfied. 

If the traveler cannot reach the destination, the string "Impossible" should be printed. One cannot reach the destination either when there are no routes leading to the destination, or when the number of tickets is not sufficient. Note that the first letter of "Impossible" is in uppercase, while the other letters are in lowercase. 

Sample Input

3 4 3 1 4
3 1 2
1 2 10
2 3 30
3 4 20
2 4 4 2 1
3 1
2 3 3
1 3 3
4 1 2
4 2 5
2 4 3 4 1
5 5
1 2 10
2 3 10
3 4 10
1 2 0 1 2
1
8 5 10 1 5
2 7 1 8 4 5 6 3
1 2 5
2 3 4
3 4 7
4 5 3
1 3 25
2 4 23
3 5 22
1 4 45
2 5 51
1 5 99
0 0 0 0 0

Sample Output

30.000
3.667
Impossible
Impossible
2.856

Hint

Since the number of digits after the decimal point is not specified, the above result is not the only solution. For example, the following result is also acceptable. 

30.0

3.66667

Impossible

Impossible

2.85595

有一个旅行家计划乘马车旅行。它所在的国家里一共有 m 个城市，在城市之间又若干道路相连。从某个城市沿着某条道路到相邻的城市需要乘马车。而乘坐马车需要使用车票，每用一张车票只可以通过一条道路。每张车票上都标记有马匹的数量，从一个城市移动到另一个城市的所需时间等于城市之间道路的长度除以嘛的数量的结果。这位旅行家一共有 n 张车票，第 i 张车票上的马的匹数是 ti。一张车票只能使用一次，并且换乘所需要的时间忽略不计。求从城市 a 到城市 b 所需要的最短时间。如果无法到达城市 b，泽输出“Impossible”。

注意到车票的数量较少，考虑状压dp。

dp[i][j] = 没使用的车票状态为 i 的情况下，到达城市 j 的最短时间。

dp[v][0] = 0;

dp[s][v] = min{dp[s&{u}][u] + d(v,u)} 其中 u 不属于 s

#include<cstdio>
#include<iostream>
#include<cstring>

using namespace std;

const int maxn = 15;
const int maxm = 40;
const double inf  = 0x3f7f7f7f;

int n, m, p, a, b;
int T[maxn];
int M[maxm][maxm];
double dp[1 << maxn][maxm];

int main()
{
	while(scanf("%d %d %d %d %d", &n, &m, &p, &a, &b), m)
	{
		//输入 ti 
		for(int i= 1; i<= n; i++)
			scanf("%d", T+i);
		
		//地图初始化 
		memset(M, -1, sizeof(M));
		
		//输入地图	
		for(int i= 1; i<= p; i++)
		{
			int x, y, z;
			scanf("%d %d %d", &x, &y, &z);
			M[x][y] = M[y][x] = z;
		}
		
		//dp数组初始化为一个足够大的值 
		for(int i= 0; i< 1<<n; i++)
			for(int j= 1; j<= m; j++)
				dp[i][j] = inf;
		
		//表示带有n张车票站在a的最短时间为0 
		dp[(1<<n) - 1][a] = 0;
		//初始化答案 
		double res = inf;
		
		for(int s= (1<<n)-1; s>= 0; s--)//枚举车票状态 
		{
			res = min(res, dp[s][b]);//更新答案 
			
			for(int f= 1; f<= m; f++)//枚举起点 
				for(int k= 0; k< n; k++)//使用的车票 
					if(s & (1<<k))//车票是否可用 
						for(int t= 1; t<= m; t++)//枚举终点 
							if(M[f][t] >= 0)//两点是否联通
								//状态转移 
								dp[s & ~(1<<k)][t] = min(dp[s & ~(1<<k)][t], dp[s][f]+1.0*M[f][t]/T[k+1]);
		}

		if(res == inf) cout << "Impossible\n";
		else cout << res << endl;
	}
	
	return 0; 
}