HDU 4848 Wow! Such Conquering! （搜索+floyd）

最新推荐文章于 2024-07-24 09:30:00 发布

原创最新推荐文章于 2024-07-24 09:30:00 发布 · 179 阅读

0 ·

CC 4.0 BY-SA版权

dfs 专栏收录该内容

4 篇文章

订阅专栏

此问题是关于一名征服者如何在限定时间内访问多个星球并完成巡视任务的算法挑战。目标是最小化总访问时间，并确保不违反每个星球的时间限制。采用Floyd算法进行最短路径预处理，通过深度优先搜索确定最优访问顺序。

Wow! Such Conquering!

Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2549 Accepted Submission(s): 768

Problem Description

There are n Doge Planets in the Doge Space. The conqueror of Doge Space is Super Doge, who is going to inspect his Doge Army on all Doge Planets. The inspection starts from Doge Planet 1 where DOS (Doge Olympic Statue) was built. It takes Super Doge exactly Txy time to travel from Doge Planet x to Doge Planet y.
With the ambition of conquering other spaces, he would like to visit all Doge Planets as soon as possible. More specifically, he would like to visit the Doge Planet x at the time no later than Deadlinex. He also wants the sum of all arrival time of each Doge Planet to be as small as possible. You can assume it takes so little time to inspect his Doge Army that we can ignore it.

Input

There are multiple test cases. Please process till EOF.
Each test case contains several lines. The first line of each test case contains one integer: n, as mentioned above, the number of Doge Planets. Then follow n lines, each contains n integers, where the y-th integer in the x-th line is Txy . Then follows a single line containing n - 1 integers: Deadline2 to Deadlinen.
All numbers are guaranteed to be non-negative integers smaller than or equal to one million. n is guaranteed to be no less than 3 and no more than 30.

Output

If some Deadlines can not be fulfilled, please output “-1” (which means the Super Doge will say “WOW! So Slow! Such delay! Much Anger! . . . ” , but you do not need to output it), else output the minimum sum of all arrival time to each Doge Planet.

Sample Input

Sample Output

-1

Hint

Explanation: In case #1: The Super Doge travels to Doge Planet 2 at the time of 8 and to Doge Planet 3 at the time of 12, then to Doge Planet 4 at the time of 16. The minimum sum of all arrival time is 36.

Source

2014西安全国邀请赛

Recommend

liuyiding

#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<string>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#define ll long long
#define maxn 1e7
#define CL(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define rep(i,s,e) for(int i=s;i<=e;i++)
const int P=1e9+7;
using namespace std;
int dis[50][50],dead[50],ans,n,vis[50];
inline int rd()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void floyd()
{
	rep(k,1,n)
	  rep(i,1,n)
	    rep(j,1,n)
	      dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
}
void dfs(int u,int t,int cnt,int tmp)
{
	if(tmp>ans) return;
	if(cnt==n)
	{
		ans=tmp;
		return;
	}
	rep(i,2,n)
	  if(!vis[i]&&t+dis[u][i]>dead[i]) return;
	rep(i,2,n)
	  if(!vis[i]&&dead[i]>=t+dis[u][i])
	  {
	  	vis[i]=1;
	  	dfs(i,t+dis[u][i],cnt+1,tmp+dis[u][i]*(n-cnt));
        vis[i]=0; 	  
	  }
} 
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		rep(i,1,n)
		   rep(j,1,n)
		      scanf("%d",&dis[i][j]);
		floyd();
		rep(i,2,n) scanf("%d",&dead[i]);
		ans=INF;CL(vis,0);vis[1]=1;
		dfs(1,0,1,0);
		if(ans==INF) printf("-1\n");
		else printf("%d\n",ans); 
	}
}