POJ 2686 Traveling by Stagecoach

题目链接

AcCode:

//输出不要用%lf,用%f不然有的地方可能会错，输入不用改变，double还是用%lf
//POJ 2868
#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 10;
double t[35];
double dp[1<<10][35];   //集合中剩余的票，现在在的城市编号
double  d[35][35];
int m, n, p, a, b;

void solve()
{
    for(int i = 0; i < (1<<n); i++)
        fill(dp[i], dp[i]+m+1, INF);
    dp[(1<<n)-1][a-1] = 0;
    double res = INF;
    for(int S = (1<<n)-1; S >= 0; S--){
        res = min(res, dp[S][b-1]);
        for(int v = 0; v < m; v++){    //当前这个点
            for(int i = 0; i < n; i++){
                if(S & (1<<i)){
                    for(int u = 0; u < m; u++){  //与它相邻的其他点
                        if(d[v][u])
                            dp[S& ~(1<<i)][u] = min(dp[S & ~(1<<i)][u], dp[S][v]+d[v][u]/t[i]);
                    }
                }
            }
        }
    }

    if(res == INF) printf("Impossible\n");
    else           printf("%.3f\n", res);
}


int main()
{
    while(scanf("%d %d %d %d %d", &n, &m, &p, &a, &b)){
        if(n == 0 && m == 0) break;
        memset(d, -1, sizeof(d));
        for(int i = 0; i < n; i++) scanf("%lf", &t[i]);
        for(int i = 0; i < p; i++){
            int v1, v2;
            double dis;
            scanf("%d %d %lf", &v1, &v2, &dis);
            d[v1-1][v2-1] = d[v2-1][v1-1] = dis;
        }
        solve();
    }
    return 0;
}