ZOJ 3620 Escape Time II(floyd+dfs)

因为每个点都可以访问多次,首先对各个点之间做一次floyd最短路,同一个连通分量的点可以互相走多次,然后进行搜索,搜索时候已经没有珠宝的房间就不要去了,最后当珠宝全部拿到手了,就去出口房间

#include <iostream>
#include <memory.h>
#include <cstdio>
using namespace std;
const int maxn=11;
#define mmin(a,b) ((a)<(b)?(a):(b))
int g[maxn][maxn],jewels[maxn],ssum,n,m,tim,s,e,ans;
bool dfs(int u,int sum,int used,int fl){
	if(used>tim)return false;
	else if(u==e){
		if(sum>ans)
			ans=sum;
		if(ans==ssum)return true;//所有珠宝都拿到了,不用继续搜了
		if(fl)return false;
	}
	int f=0;
	for (int i=0;i<n;++i){
		if(u!=i&&g[u][i]!=0X23232323&&jewels[i]){
			int t=jewels[i];
			jewels[i]=0;
			if(dfs(i,sum+t,used+g[u][i],0))return true;//不去出口
			jewels[i]=t;
			f=1;
		}
	}
	if(f==0&&g[u][e]!=0X23232323){//每个房间都没有珠宝了,去出口
		dfs(e,sum,used+g[u][e],1);
	}
	return false;
}
int main(){
	while (scanf("%d%d%d",&n,&m,&tim)==3){
		scanf("%d%d",&s,&e);
		ssum=0;
		for (int i=0;i<n;++i){
			scanf("%d",&jewels[i]);
			ssum+=jewels[i];
		}
		memset(g,0X23,sizeof(g));
		for (int i=0;i<m;++i){
			int u,v,w;
			scanf("%d%d%d",&u,&v,&w);
			if(g[u][v]>w){
				g[u][v]=g[v][u]=w;
			}
		}
		for (int k=0;k<n;++k){
			for (int i=0;i<n;++i){
				for (int j=0;j<n;++j){
					g[i][j]=mmin(g[i][j],g[i][k]+g[k][j]);
				}
			}
		}
		ans=0;
		int t=jewels[s];
		jewels[s]=0;
		dfs(s,t,0,0);
		printf("%d\n",ans);
	}

	return 0;
}