Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

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
4
0 3 8 6
4 0 7 4
7 5 0 2
6 9 3 0
30 8 30
4
0 2 3 3
2 0 3 3
2 3 0 3
2 3 3 0
2 3 3
 
Sample Output
36
-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.

首先Floyd算法得到任意两点间的最短时间;

然后之间进行DFS,剪枝优化时间。

 #include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 33
#define INF 0x3f3f3f3f
using namespace std;
int d[MAXN][MAXN],ans;
int n,deadline[MAXN],arrival_time[MAXN];
bool vis[MAXN];
void floyd()
{
for(int k=;k<=n;k++)
{
for(int i=;i<=n;i++)
{
for(int j=;j<=n;j++) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
void dfs(int now,int cur_time,int sum_time,int cnt)
{
if(cnt==n)//走完了n个星球
{
ans=min(ans,sum_time);//尝试更新答案,使得答案是到目前为止的最优解
return;
} if(sum_time + cur_time * (n-cnt) >= ans) return;
//最优性剪枝:当前到达时间和 + 当前时间 * 还没去的星球 >= 到目前为止的最优解,剪掉
//      因为,到目前为止,还没去的星球,到达那里的时间必然大于等于当前时间 for(int i=;i<=n;i++) if(!vis[i] && cur_time>deadline[i]) return;
//可行性剪枝:到目前为止,现在的时间大于未到达的星球的deadline,已经不满足要求,剪掉 for(int next=;next<=n;next++)
{
if(now!=next && !vis[next] && cur_time+d[now][next]<=deadline[next])
{
vis[next]=;
dfs(next,cur_time+d[now][next],sum_time+cur_time+d[now][next],cnt+);
vis[next]=;
}
} }
int main()
{
while(scanf("%d",&n)!=EOF)
{
for(int i=;i<=n;i++)
for(int j=;j<=n;j++)
{
scanf("%d",&d[i][j]);
} for(int i=;i<=n;i++) scanf("%d",&deadline[i]);
deadline[]=INF; floyd(); ans=INF;
vis[]=;
dfs(,,,);
printf("%d\n", ((ans==INF)?-:ans) );
}
}

HDU 4848 - Wow! Such Conquering!的更多相关文章

  1. hdu 4848 Wow! Such Conquering! (floyd dfs)

    Wow! Such Conquering! Problem Description There are n Doge Planets in the Doge Space. The conqueror ...

  2. HDU-4848 Wow! Such Conquering! 爆搜+剪枝

    Wow! Such Conquering! 题意:一个n*n的数字格,Txy表示x到y的时间.最后一行n-1个数字代表分别到2-n的最晚时间,自己在1号点,求到达这些点的时间和的最少值,如果没有满足情 ...

  3. hdu 4850 Wow! Such String! 欧拉回路

    作者:jostree 转载请注明出处 http://www.cnblogs.com/jostree/p/4080264.html 题目链接:hdu 4850 Wow! Such String! 欧拉回 ...

  4. hdu 4893 Wow! Such Sequence!(线段树)

    题目链接:hdu 4983 Wow! Such Sequence! 题目大意:就是三种操作 1 k d, 改动k的为值添加d 2 l r, 查询l到r的区间和 3 l r. 间l到r区间上的所以数变成 ...

  5. HDU 4850 Wow! Such String!(欧拉道路)

    HDU 4850 Wow! Such String! 题目链接 题意:求50W内的字符串.要求长度大于等于4的子串,仅仅出现一次 思路:须要推理.考虑4个字母的字符串,一共同拥有26^4种,这些由这些 ...

  6. HDU 4849 Wow! Such City!陕西邀请赛C(最短路)

    HDU 4849 Wow! Such City! 题目链接 题意:依照题目中的公式构造出临接矩阵后.求出1到2 - n最短路%M的最小值 思路:就依据题目中方法构造矩阵,然后写一个dijkstra,利 ...

  7. HDU 4848

    http://acm.hdu.edu.cn/showproblem.php?pid=4848 题意:求遍历所有点的最小值(这个答案是加i点到起始点的距离,不是当前点到i的距离),必须在ti[i]前到达 ...

  8. HDU 4893 Wow! Such Sequence! (线段树)

    Wow! Such Sequence! 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=4893 Description Recently, Doge ...

  9. hdu 4848 搜索+剪枝 2014西安邀请赛

    http://acm.hdu.edu.cn/showproblem.php?pid=4848 比赛的时候我甚至没看这道题,事实上不难.... 可是说实话,如今对题意还是理解不太好...... 犯的错误 ...

随机推荐

  1. 浅谈Java的学习

    Java就是用来做项目的!Java的主要应用领域就是企业级的项目开发!要想从事企业级的项目开发,你必须掌握如下要点: 1.掌握项目开发的基本步骤2.具备极强的面向对象的分析与设计技巧3.掌握用例驱动. ...

  2. vuejs监听苹果iphone手机键盘事件

    在iphone手机中,vue提供的keyup事件是不能监听iphone键盘的,但是h5提供的input事件可以做到. 只需要向下面这样处理,就可以解决iphone不响应键盘事件的bug <tem ...

  3. 采用get方式提交数据到服务器实例

    GetDemo项目目录 一.编写StreamTools.java /** * */ package com.hyzhou.getdemo.utiils; import java.io.ByteArra ...

  4. Ubuntu图形界面和字符界面转换、指定默认启动界面

    1.按ALT+CTRL+F1.F2.F3.F4.F5.F6.F7可来回切换7个界面(Linux实体机)      其中ALT+CTRL+F7可切换到图形界面(Linux实体机)        如果是V ...

  5. Unity3D Shader官方教程翻译(十九)----Shader语法,编写表面着色器

    Writing Surface Shaders Writing shaders that interact with lighting is complex. There are different ...

  6. CharacterMotor_刚体角色驱动

    using UnityEngine; //this class holds movement functions for a rigidbody character such as player, e ...

  7. [SublimeText] 之 Packages

    概述 Packages 是指供 Sublime Text 使用的资源文件集合,例如插件.语法高亮.菜单.片断等等.Sublime Text 自身安装了一些 Packages,还有很多用户创建的 Pac ...

  8. springboot 集成elasticsearch

    In this article, we will discuss about “How to create a Spring Boot + Spring Data + Elasticsearch Ex ...

  9. Google TensorFlow 机器学习框架介绍和使用

    TensorFlow是什么? TensorFlow是Google开源的第二代用于数字计算(numerical computation)的软件库.它是基于数据流图的处理框架,图中的节点表示数学运算(ma ...

  10. 【技术分享会】 @第六期 iOS开发基础

    前言 iOS之前被称为 iPhone OS,是一个由苹果公司开发的移动操作系统. iOS的第一个版本是在2007年发布的,其中包括iPhone和iPod Touch. iOS开发工具:Xcode 运行 ...