hdu_5711_Ingress(TSP+貪心)

題目連接：hdu5711

這題是 HDU 女生賽最後一題，TSP+貪心，確實不好想，看了wkc巨巨的題解，然後再做的

題解傳送門：Ingress

#include<cstdio>
#include<queue>
#include<algorithm>
#define F(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef pair<int,int> P;
inline void up(int &x,int y){if(x>y)x=y;}

int ic=1,t,n,m,ans,k,en,l,u,v,c,inf=1e9+7;
int a[20],b[20],g[20][20],dp[1<<16][17],vis[1<<16];

int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d%d%d%d",&n,&m,&k,&l);en=(1<<n)-1;
		F(i,0,n)F(j,0,n)g[i][j]=(i==j?0:inf);
		F(i,0,en)F(j,0,n)dp[i][j]=inf;
		F(i,0,en)vis[i]=0;
		F(i,1,n)scanf("%d",a+i);
		F(i,1,n)scanf("%d",b+i);
		F(i,1,m)scanf("%d%d%d",&u,&v,&c),up(g[u][v],c),up(g[v][u],c);
		F(kk,0,n)F(i,0,n)F(j,0,n)up(g[i][j],g[i][kk]+g[kk][j]);//Floyd
		dp[0][0]=0,ans=0;
		F(i,0,en){
			F(j,0,n)if(dp[i][j]<=l){
				if(dp[i][j]+g[j][0]<=l)vis[i]=1;
				F(q,1,n)if(q==j||i&1<<q-1)continue;
				else up(dp[i|1<<q-1][q],dp[i][j]+g[j][q]);
			}
			if(vis[i]){
				priority_queue<P>Q;
				F(j,1,n)if(i&1<<j-1)Q.push(P(a[j],b[j]));
				if(Q.empty())continue;
				int tmp=0;
				F(j,1,k){
					tmp+=Q.top().first;
					Q.push(P(max(Q.top().first-Q.top().second,0),Q.top().second));
					Q.pop();
				}
				ans=max(ans,tmp);
			}
		}
		printf("Case %d: %d\n",ic++,ans);
	}
	return 0;
}