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=,t,n,m,ans,k,en,l,u,v,c,inf=1e9+;
 int a[],b[],g[][],dp[<<][],vis[<<];

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