A Walk Through the Forest 最短路+dp
来源:互联网 发布:网络主播黑名单第二批 编辑:程序博客网 时间:2024/06/04 00:46
A Walk Through the Forest
Time Limit:1000MS Memory Limit:65536K
Total Submit:48 Accepted:15
Description
Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is on one side of a forest, and his house is on the other. A nice walk through the forest, seeing the birds and chipmunks is quite enjoyable.
The forest is beautiful, and Jimmy wants to take a different route everyday. He also wants to get home before dark, so he always takes a path to make progress towards his house. He considers taking a path from A to B to be progress if there exists a route from B to his home that is shorter than any possible route from A. Calculate how many different routes through the forest Jimmy might take.
Input
Input contains several test cases followed by a line containing 0. Jimmy has numbered each intersection or joining of paths starting with 1. His office is numbered 1, and his house is numbered 2. The first line of each test case gives the number of intersections N, 1 < N ≤ 1000, and the number of paths M. The following M lines each contain a pair of intersections a b and an integer distance 1 ≤ d ≤ 1000000 indicating a path of length d between intersection a and a different intersection b. Jimmy may walk a path any direction he chooses. There is at most one path between any pair of intersections.
Output
For each test case, output a single integer indicating the number of different routes through the forest. You may assume that this number does not exceed 2147483647.
Sample Input
5 61 3 21 4 23 4 31 5 124 2 345 2 247 81 3 11 4 13 7 17 4 17 5 16 7 15 2 16 2 10
Sample Output
24
题目大意是给一个图。起点为1,终点为2
然后点a到点b是合法的判断是当b存在一个到终点的距离小于a到终点的最小距离。。。。。求从起点到终点的路径数。。
我的做法是dijk + sort + dp。先dijk出任何点到2的最小距离。然后按照距离对他们sort 。
dp就是很普通的路径dp:ans[终点] += ans[起点];
- A Walk Through the Forest 最短路+dp
- 【UVa】10917 A Walk Through the Forest 最短路+DP
- UVA 10917 Walk Through the Forest(最短路+dp)
- UVA - 10917 Walk Through the Forest (最短路+DP)
- UVA - 10917 Walk Through the Forest (最短路+DP)
- UVA 10917 - Walk Through the Forest(最短路`dijksta+DP)
- hdu1142-A Walk Through the Forest-最短路+dfs
- A Walk Through the Forest(最短路+dfs)
- HDU 1142 A Walk Through the Forest 最短路+DFS
- A Walk Through the Forest(hdu1142,最短路+dfs)
- hdu 1142 A Walk Through the Forest 最短路
- hdu 1142 A Walk Through the Forest (最短路+dfs )
- hdu 1142 A Walk Through the Forest 最短路
- hdu 1142 A Walk Through the Forest(最短路)
- 杭电1142 A Walk Through the Forest (最短路+DFS+dp)
- HDU - 1142 A Walk Through the Forest (DP + 最短路)
- uva 10917 Walk Through the Forest(最短路+DP路径,4级)
- UVa 10917 Walk Through the Forest(最短路+DP)
- 2010-08-11
- 《Linux那些事儿之我是USB》我是U盘(4)想到达明天现在就要启程
- 打开eclipse出现JVM terminated.Exit Code=-1错误的解决办法
- 判断大小端
- xen3.0启动虚拟机fsimage.so的问题及解决
- A Walk Through the Forest 最短路+dp
- IT生活-业务调研之我见
- error: cannot restore segment prot after reloc
- win32平台关于“pure virtual function call”的解释
- AS3 中的is与as操作符的区别
- 接指示符extern C
- 网络命令
- 电脑人的病
- 全局变量和局部变量在内存里的区别