题目大意
解题思路
枚举钻石买卖情况,通过spfa更新当前情况停留在所有点的答案,再考虑再停留点卖钻石的情况。
code
using namespace std;
int const maxn=1500,maxt=4000,inf=1e9;
int n,m,t,K,S,gra,a[maxn+10][11],to[maxt+10],len[maxt+10],next[maxt+10],
begin[maxn+10],qu[maxn*4+10],inq[maxn+10],F[1024+10][maxn+10];
void insert(int u,int v,int w){
to[++gra]=v;
len[gra]=w;
next[gra]=begin[u];
begin[u]=gra;
}
int main(){
freopen("d.in","r",stdin);
freopen("d.out","w",stdout);
scanf("%d%d%d%d%d",&n,&t,&m,&K,&S);
fo(i,1,n)fo(j,1,m)scanf("%d",&a[i][j]);int u,v,w;
fo(i,1,t){
scanf("%d%d%d",&u,&v,&w);
insert(u,v,w);
}
int mx=(1<<m)-1;
fo(i,0,mx)fo(j,1,n)F[i][j]=-inf;
F[0][S]=K;
fo(s,0,mx-1){
int he=0,ti=0;
fo(j,1,n)if(F[s][j]>=0)inq[qu[++ti]=j]=1;
while(he!=ti){
int now=qu[++he];
for(int i=begin[now];i;i=next[i])
if((F[s][now]-len[i]>=0)&&(F[s][to[i]]<=F[s][now]-len[i])){
F[s][to[i]]=F[s][now]-len[i];
if(!inq[to[i]])inq[qu[++ti]=to[i]]=1;
}
inq[now]=0;
}fo(j,1,n)if(F[s][j]>=0)fo(k,1,m)if(!(s&(1<<(k-1))))F[s|(1<<(k-1))][j]=max(F[s|(1<<(k-1))][j],F[s][j]+a[j][k]);
}
int ans=0;
fo(i,1,n)ans=max(ans,F[mx][i]);
printf("%d",ans);
return 0;
}