poj2686Traveling by Stagecoach(状态压缩)
2015-09-17 14:36
190 查看
Traveling by Stagecoach
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
Time Limit: 2000MS | Memory Limit: 65536K | |||
Total Submissions: 2487 | Accepted: 878 | Special Judge |
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#include <map> #include <set> #include <stack> #include <queue> #include <cmath> #include <ctime> #include <vector> #include <cstdio> #include <cctype> #include <cstring> #include <cstdlib> #include <iostream> #include <algorithm> using namespace std; #define INF 0x3f3f3f3f #define inf -0x3f3f3f3f #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 #define mem0(a) memset(a,0,sizeof(a)) #define mem1(a) memset(a,-1,sizeof(a)) #define mem(a, b) memset(a, b, sizeof(a)) typedef long long ll; double dp[1<<9][31]; int mp[31][31]; int time1[9]; int main(){ int n,m,p,a,b; while(scanf("%d%d%d%d%d",&n,&m,&p,&a,&b)!=EOF){ if(m==0&&n==0&&p==0&&a==0&&b==0) break; for(int s=0;s<(1<<n);s++) fill(dp[s],dp[s]+m+1,INF); mem1(mp); for(int i=0;i<n;i++) scanf("%d",&time1[i]); int u,v,w; for(int i=1;i<=p;i++){ scanf("%d%d%d",&u,&v,&w); if(mp[u][v]==-1&&mp[v][u]==-1){ mp[u][v]=mp[v][u]=w; } else{ mp[u][v]=mp[v][u]=min(w,mp[u][v]); } } dp[0][a]=0; double ans=INF; for(int s=1;s<(1<<n);s++){ for(int i=1;i<=m;i++) for(int j=1;j<=m;j++){ if(mp[i][j]==-1) continue; for(int k=0;k<n;k++){ if((s>>k)&1==0||dp[(s^(1<<k))][i]==INF) continue; dp[s][j]=min(dp[(s^(1<<k))][i]+(double)mp[i][j]/time1[k],dp[s][j]); //printf("i is %d j is %d s is %d ",i,j,s); //printf("%.3lf\n",dp[s][j]); if(j==b) ans=min(ans,dp[s][j]); } } } if(ans==INF){ printf("Impossible\n"); continue; } printf("%.3f\n",ans); } return 0; }
相关文章推荐
- 资料
- 《黑马程序员》Java网络编程 GUI 正则表达式
- 敏捷开发二——极限编程
- HDU 1896 Stones (Priority_queue)
- 潜龙(CHLoong)软件使用及功能说明
- 营销型网站和普通型企业网站有什么不同?
- 齐家网要做透明的家装O2O平台?不,其目的是金融
- july的谱聚类
- 输入输出之转换流InputStreamReader&OutputStreamWriter
- 常用socket函数详解
- 数字签名的定义及在K2 BPM业务流程管理中的应用
- 在一个GameObject上进行多个AudioSource的控制
- PIC和PIE
- 利用marquee对html页面文本滚动
- UITextField长度限制
- Spring AOP Advices - Around advice example - xml based configuration
- 解决 AFNetWorking报错 text/html
- kalman滤波的一些理解
- vector中 迭代器的使用 以及元素的去重、排序、插入、删除操作。 【小笔记】
- 敏捷开发之一—笼统的介绍