题意:
给你一颗树,从树中选出不超过M个点,去运输K种食材。求所有酒店的等待时间的最大值最小的值。
题解:
cost[i][j]表示从j点出发运输i号食材所需要的时间,t[i][S]表示从i出发运输S集合中对应的食材所需要的的时间,f[j][S]选出j个点去运输S集合中对应的食材所需要的的时间
代码如下:
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e2+5,INF=2e9+7;
int n,m,K,cost[15][maxn],t[maxn][1050],f[15][1050];
int maxState,ans;
bool mp[maxn][15],vis[maxn];
struct node{
int id,dis;
};
vector<node>vec[maxn];
struct bNode{
int pre,dis;
};
bNode A[maxn];
int getCost(int pos,int sta){
int i,lenV,preId,sum,maxBranch,tmpPos;
queue<node>qu;
node now,next;
memset(vis,0,sizeof(vis));
for (i=1;i<=n;i++)A[i].pre=-1,A[i].dis=INF;
vis[sta]=true;A[sta].dis=0;
qu.push({sta,0});
while(!qu.empty()){
now=qu.front();qu.pop();
lenV=vec[now.id].size();
for (i=0;i<lenV;i++){
next=vec[now.id][i];
if(vis[next.id])continue;
vis[next.id]=true;
A[next.id].pre=now.id;A[next.id].dis=now.dis+next.dis;
qu.push({next.id,A[next.id].dis});
}
}
memset(vis,0,sizeof(vis));
sum=maxBranch=0;
for (i=1;i<=n;i++){
if(i==sta)continue;
if(!mp[i][pos])continue;
tmpPos=i;
while(A[tmpPos].pre!=-1&&(!vis[tmpPos])){
preId=A[tmpPos].pre;
sum+=A[tmpPos].dis-A[preId].dis;
vis[tmpPos]=true;
if(vis[preId])break;
tmpPos=preId;
}
maxBranch=max(maxBranch,A[i].dis);
}
return 2*sum-maxBranch;
}
int main(){
int i,j,a,b,c,S,_time,U;
while(scanf("%d%d%d",&n,&m,&K)!=EOF){
for (i=0;i<=100;i++)vec[i].clear();
maxState=(1<<K)-1;ans=INF;
for (i=1;i<=n;i++)for (j=1;j<=K;j++)scanf("%d",&mp[i][j]);
for(i=1;i<n;i++){
scanf("%d%d%d",&a,&b,&c);
vec[a].push_back({b,c});
vec[b].push_back({a,c});
}
for (i=1;i<=K;i++)for (j=1;j<=n;j++)cost[i][j]=getCost(i,j);
for (i=1;i<=n;i++){
for (S=1;S<=maxState;S++){
_time=0;t[i][0]=0;
for (j=1;j<=K;j++)if((S>>(j-1))&1)_time=max(_time,cost[j][i]);
t[i][S]=_time;
}
}
for (i=0;i<=m;i++)for (j=0;j<=maxState;j++)f[i][j]=INF;
for (i=0;i<=m;i++)f[i][0]=0;
for (i=1;i<=n;i++){
for (j=1;j<=m;j++){
for (S=1;S<=maxState;S++){
for (U=S;U;U=(U-1)&S){
if(f[j-1][S^U]!=INF)
f[j][S]=min(f[j][S],max(f[j-1][S^U],t[i][U]));
}
}
}
}
for (j=1;j<=m;j++)ans=min(ans,f[j][maxState]);
printf("%d\n",ans);
}
return 0;
}