ZOJ - 3620——Escape Time II

题意：一个人要从房间里逃出来并且拿尽量多的珠宝。问最多可以拿多少
思路：先把房间两两距离求出来，然后状态压缩
代码如下：

#include<cstdio>
#include<cstdlib>
#include<math.h>
#include<iostream>
#include<cstring>
#include<map>
#include<set>
#include<list>
#include<stack>
#include<algorithm>
#include<queue>
#include<vector>
#include<time.h>
#include<iomanip>
using namespace std;
const int inf = 999999999;
int dis[15][15];
int n,m,t;
int s,e;
int val[15];

struct STA{
    int p,s;
    STA(int _p,int _s):p(_p),s(_s){}
};

int dp[15][1<<10];

int cnt(int x)
{
    int ret = 0;
    for(int i = 0 ;i<n;++i){
        if(x&(1<<i)){
            ret += val[i];
        }
    }
    return ret;
}

int main()
{
//    freopen("data.txt","r",stdin);
    while(scanf("%d%d%d",&n,&m,&t)!=EOF){
        scanf("%d%d",&s,&e);
        for(int i = 0 ;i<n;++i){
            for(int j = 0 ;j<n;++j){
                dis[i][j] = 999999999;
            }
        }
        for(int i = 0 ;i<n;++i){
            scanf("%d",&val[i]);
        }
        for(int i = 0 ;i<m;++i){
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            dis[a][b] = min(dis[a][b],c);
            dis[b][a] = dis[a][b];
        }
        for(int k = 0;k<n;++k){
            for(int i = 0;i<n;++i){
                if(dis[i][k] == inf)continue;
                for(int j = 0 ;j<n;++j){
                    if(dis[k][j] == inf)continue;
                    dis[i][j] = min(dis[i][j],dis[i][k]+dis[k][j]);
                }
            }
        }
        if(dis[s][e] == inf){
            puts("0");continue;
        }
        memset(dp,-1,sizeof(dp));
        dp[s][1<<s] = 0;
        queue<STA> q;
        q.push(STA(s,1<<s));
        while(!q.empty()){
            STA c = q.front();
            q.pop();
            for(int i = 0 ;i<n;++i){
                if(dis[c.p][i] == inf)continue;
                if(dp[i][c.s|(1<<i)]==-1|| dp[i][c.s|(1<<i)]>dp[c.p][c.s]+dis[c.p][i]){
                    dp[i][c.s|(1<<i)] = dp[c.p][c.s]+dis[c.p][i];
//                    cout<<c.p<<' '<<i<<' '<<(c.s|(1<<i))<<' '<<dp[i][c.s|(1<<i)]<<' '<<dp[c.p][c.s]<<' '<<c.s<<endl;
                    q.push(STA(i,c.s|(1<<i)));
                }
            }
        }
        int ans = 0;
        for(int i = 0;i<=(1<<(n+1))-1;++i){
            if(dp[e][i]>t||dp[e][i] == -1)continue;
//            cout<<"i="<<i<<endl;
            ans = max(ans,cnt(i));
        }
        printf("%d\n",ans);
    }
    return 0;
}