Traveling by Stagecoach POJ - 2686

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

题解:dp[S][v]:=到达剩下的车票集合为S并且现在城市在v的状态所需要的最小花费。DP好难啊!!!!
 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 using namespace std;
 6
 7 const double INF=10000000.0;
 8
 9 int n,m,p,a,b;
10 int t[10],d[35][35];
11 double dp[1<<10][35];
12
13 void Init(){
14     for(int i=0;i<(1<<n);i++)
15         fill(dp[i],dp[i]+m,INF);
16     for(int i=0;i<m;i++)
17         for(int j=0;j<m;j++) d[i][j]=-1;
18 }
19
20 void Read(){
21     for(int i=0;i<n;i++) scanf("%d",&t[i]);
22     int u,v,cost;
23     for(int i=0;i<p;i++){
24         scanf("%d%d%d",&u,&v,&cost);
25         d[u-1][v-1]=cost;
26         d[v-1][u-1]=cost;
27     }
28 }
29
30 void solve(){
31     dp[(1<<n)-1][a-1]=0;
32     double ans=INF;
33
34     for(int S=(1<<n)-1;S>=0;S--){
35         ans=min(ans,dp[S][b-1]);
36         for(int v=0;v<m;v++){
37             for(int i=0;i<n;i++){
38                 if(S>>i&1){
39                     for(int u=0;u<m;u++){
40                         if(d[v][u]>=0) dp[S&~(1<<i)][u]=min(dp[S&~(1<<i)][u],dp[S][v]+(double)d[v][u]/t[i]);
41                     }
42                 }
43             }
44         }
45     }
46     if(ans==INF) cout<<"Impossible"<<endl;
47     else printf("%.3f\n",ans);
48 }
49
50 int main()
51 {   while(scanf("%d%d%d%d%d",&n,&m,&p,&a,&b)){
52         if(!n&&!m&&!p&&!a&&!b) break;
53
54         Init();
55         Read();
56         solve();
57     }
58     return 0;
59 }
时间: 2024-11-04 14:13:11

Traveling by Stagecoach POJ - 2686的相关文章

POJ 2686 Traveling by Stagecoach(状压二维SPFA)

Traveling by Stagecoach Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 3407   Accepted: 1322   Special Judge Description Once upon a time, there was a traveler. He plans to travel using stagecoaches (horse wagons). His starting point an

poj 2686 Traveling by Stagecoach

Traveling by Stagecoach Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 3293   Accepted: 1253   Special Judge Description Once upon a time, there was a traveler. He plans to travel using stagecoaches (horse wagons). His starting point an

POJ 2686 Traveling by Stagecoach (状态压缩DP)

Traveling by Stagecoach Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 2776   Accepted: 996   Special Judge Description Once upon a time, there was a traveler. He plans to travel using stagecoaches (horse wagons). His starting point and

poj2686 Traveling by Stagecoach

http://poj.org/problem?id=2686 Traveling by Stagecoach Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 2276   Accepted: 787   Special Judge Description Once upon a time, there was a traveler. He plans to travel using stagecoaches (horse

Traveling by Stagecoach 状态压缩裸题

Traveling by Stagecoach dp[s][v]  从源点到达  v,状态为s,v的最小值.  for循环枚举就行了. 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <string> 7 #include <vector>

POJ 2686 Traveling by Stagecoach(状压DP)

[题目链接] http://poj.org/problem?id=2686 [题目大意] 给出一张无向图,你有n张马车票每张车票可以租用ti匹马, 用一张马车票从一个城市到另一个城市所用的时间为这两个城市间的道路距离除以马的数量 一张马车票只能用一次,问从a到b的最短时间 [题解] dp[S][u]表示剩余的车票集合为S,到达u所用的最短时间, 之后我们枚举剩余的车票集合,枚举边和用的车票,进行状态转移. [代码] #include <cstdio> #include <climits&

POJ 2686 Traveling by Stagecoach (状压DP)

题意:有一个人从某个城市要到另一个城市, 有n个马车票,相邻的两个城市走的话要消耗掉一个马车票.花费的时间呢,是马车票上有个速率值 ,问最后这个人花费的最短时间是多少. 析:和TSP问题差不多,dp[s][i] 表示当前在第 i 个城市,还剩余集合 s的票,需要的最短时间.状态转移方程: dp[s][i] = min{dp[s|j][k] + d[i][k] } 代码如下: #pragma comment(linker, "/STACK:1024000000,1024000000")

poj2686(Traveling by Stagecoach)状态压缩dp

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

POJ2686 Traveling by Stagecoach(状压DP+SPFA)

题目大概是给一张有向图,有n张票,每张票只能使用一次,使用一张票就能用pi匹马拉着走过图上的一条边,走过去花的时间是边权/pi,问从a点走到b点的最少时间是多少. 用dp[u][S]表示当前在u点且用过的票集合是S的最少时间,丢进SPFA更新. 1 #include<cstdio> 2 #include<cstring> 3 #include<queue> 4 using namespace std; 5 #define INF 1e8 6 #define MAXN 3