HDU - 4114

思路是 三维状压dp + floyd更新

dp[i][j][k] i表示为已经走过的景点 j表示为 已经获取的经典的pass票 k表示最后一次走到的地方是 k

#include<iostream>
#include<cstring>

using namespace std;

const int N = 55,M = 1 << 8;

int a[N][N],pos[N],T[N],FT[N],pass[N];

int n,m,k;
void floyd(){
	for(int k = 1; k <= n; k++){
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				a[i][j] = min(a[i][j],a[i][k] + a[k][j]);
			}
		}
	}
}

int dp[M][M][N];//已经去过的景点 ,手中已有的票 ，最后一次去的地点 
int ans;
void solve(){
	memset(dp,0x3f,sizeof dp);
	dp[0][0][1] = 0;
	for(int i = 0; i < (1 << k); i++){
		for(int j = 0; j < (1 << k); j++){
			for(int d = 1; d <= n; d++){
				if(dp[i][j][d] == 0x3f3f3f3f) continue;
				if(i == ((1 << k) - 1)) ans = min(ans,dp[i][j][d] + a[d][1]);
				for(int l = 0; l < k; l++){
					if(i >> l & 1) continue;
					if(j >> l & 1){
						dp[i ^ (1 << l)][j][pos[l]] = min(dp[i ^ (1 << l)][j][pos[l]],dp[i][j][d] + FT[l] + a[d][pos[l]]);
					}else{
						dp[i ^ (1 << l)][j][pos[l]] = min(dp[i ^ (1 << l)][j][pos[l]],dp[i][j][d] + T[l] + a[d][pos[l]]);
					}
				}
				
				for(int l = 1; l <= n; l++){
					int &s = dp[i][j | pass[l]][l];
					s = min(s,dp[i][j][d] + a[d][l]);
				}
			}
		}
	}
}

int main(){
	int t;
	cin >> t;
	int cas = 0;
	while(t--){
		ans = 0x3f3f3f3f;
		memset(a,0x3f,sizeof a);
		memset(pass,0,sizeof pass);
		scanf("%d%d%d",&n,&m,&k);
		for(int i = 1; i <= n; i++){
			a[i][i] = 0;
		}
		for(int i = 1; i <= m; i++){
			int x,y,z;
			scanf("%d%d%d",&x,&y,&z);
			a[x][y] = z;
			a[y][x] = z;
		}
		for(int i = 0; i < k; i++){
			int p;
			scanf("%d%d%d%d",&pos[i],&T[i],&FT[i],&p);
			for(int j = 1; j <= p; j++){
				int c;
				scanf("%d",&c);
				pass[c] |= (1 << i);
			}
		}
		floyd();
		
		solve();
		
		printf("Case #%d: %d\n",++cas,ans);
	}
	return 0;
}