HDOJ 5385 The path

【HDOJ 5385 The path】的更多相关文章

贪心 HDOJ 5385 The Path

题目传送门 /* 题意:给一张图和一些有向边,问如何给边赋值使得d1 < d2 < .. < dx > ,,,< ddn 贪心:左边从2开始,右边从n开始,每次选择未标记且相连的点加入树,加入时间就是d[i],若不在树上的输出n,注意重边和重点 */ /************************************************ * Author :Running_Time * Created Time :2015-8-13 12:09:17 * File…

Dicription You have a connected directed graph.Let $d(x)$ be the length of the shortest path from $1$ to $x$.Specially $d(1)=0$.A graph is good if there exist $x$ satisfy $d(1)<d(2)<....d(x)>d(x+1)>...d(n)$.Now you need to set the length of ev…

2015 Multi-University Training Contest 8 hdu 5385 The path

The path Time Limit: 2000ms Memory Limit: 65536KB This problem will be judged on HDU. Original ID: 538564-bit integer IO format: %I64d Java class name: Main Special Judge You have a connected directed graph.Let d(x) be the length of the shorte…

hdu 5385 The path

http://acm.hdu.edu.cn/showproblem.php?pid=5385 题意: 给定一张n个点m条有向边的图,构造每条边的边权(边权为正整数),令d(x)表示1到x的最短路,使得存在点i(1<=i<=n)满足d(1)<d(2)<…<d(i)>d(i+1)>…>d(n). 从两边向中间构造. 开始L=1,R=n 从L开始bfs,顺次构造L,L+1,L+2…… 构造不动了再从R开始bfs,顺次构造R,R-1,R-2…… 然后在从L开始………

HDU.5385.The path(构造)

题目链接最短路构造题三连:这道题,HDU4903,SRM590 Fox And City. $Description$ 给定一张$n$个点$m$条边的有向图,每条边的边权在$[1,n]$之间.记$d[i]$为$1$到$i$的最短路.你需要对每条边确定一个边权,使得存在一个$i\in[2,n]$,满足$d[1]\lt d[2]\lt...d[i]\gt d[i+1]\gt...d[n]$. 输出方案(每条边的边权).输入保证有解. \(n,m\leq10^5\…

2015 Multi-University Training Contest 8

Hdu 5385 The path 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5385 题意:有一个联通的有向图,d(x)用来记录从1点到x点的最短路径长度,d(1)=0;一个图可以称之为好图是存在一个x使得d(1)<d(2)<....d(x)>d(x+1)>...d(n), 现在你要设置每一条边的长度使得这个图是一个好图,注意,满足d(1)<d(2)<..d(n)的也是一个好图.边的长度在1~n的范围内.一定存在解决…

hdu 1232, disjoint set, linked list vs. rooted tree, a minor but substantial optimization for path c 分类： hdoj 2015-07-16 17:13 116人阅读评论(0) 收藏

three version are provided. disjoint set, linked list version with weighted-union heuristic, rooted tree version with rank by union and path compression, and a minor but substantial optimization for path compression version FindSet to avoid redundanc…