A Walk Through the Forest

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10172    Accepted Submission(s): 3701

Problem 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 6
1 3 2
1 4 2
3 4 3
1 5 12
4 2 34
5 2 24
7 8
1 3 1
1 4 1
3 7 1
7 4 1
7 5 1
6 7 1
5 2 1
6 2 1
0
 
Sample Output
2
4
 
Source
 
Recommend
Eddy   |   We have carefully selected several similar problems for you:  1217 1385 1548 1596 2112 
 
题目意思:
这道题不是求最短路的条数!!!
注意了
题目是说如果A到终点的距离大于B到终点的距离,那么我们认为A到B是满足条件的路径
问你满足条件的路的条数
分析:
先用终点做起点然后求单源最短路,得到每个点到终点的距离
然后通过记忆化搜索,搜满足条件的路径数目!!!
 
主要是题目意思难懂,很容易误解成为求1到2的最短路条数
code:
  1. #include<iostream>
  2. #include<stdio.h>
  3. #include<memory.h>
  4. using namespace std;
  5. #define max_v 1005
  6. #define INF 9999999
  7. int n,m;
  8. int vis[max_v];
  9. int dis[max_v];
  10. int e[max_v][max_v];
  11. int dp[max_v];
  12. void init()
  13. {
  14. memset(vis,,sizeof(vis));
  15. for(int i=;i<=n;i++)
  16. {
  17. for(int j=;j<=n;j++)
  18. {
  19. e[i][j]=INF;
  20. }
  21. dp[i]=-;
  22. dis[i]=INF;
  23. }
  24. }
  25. void Dijkstra(int s)
  26. {
  27. for(int i=;i<=n;i++)
  28. dis[i]=e[s][i];
  29. dis[s]=;
  30. for(int i=;i<=n;i++)
  31. {
  32. int index,mindis=INF;
  33. for(int j=;j<=n;j++)
  34. {
  35. if(!vis[j]&&dis[j]<mindis)
  36. {
  37. mindis=dis[j];
  38. index=j;
  39. }
  40. }
  41. vis[index]=;
  42. for(int j=;j<=n;j++)
  43. if(dis[index]+e[index][j]<dis[j])
  44. dis[j]=dis[index]+e[index][j];
  45. }
  46. }
  47. int dfs(int v)
  48. {
  49. if(dp[v]!=-)
  50. return dp[v];
  51. if(v==)
  52. return ;
  53. int sum=;
  54. for(int i=;i<=n;i++)
  55. if(dis[v]>dis[i]&&e[v][i]!=INF)
  56. sum+=dfs(i);
  57. dp[v]=sum;
  58. return dp[v];
  59. }
  60. int main()
  61. {
  62. while(~scanf("%d",&n))
  63. {
  64. if(!n)
  65. break;
  66. scanf("%d",&m);
  67. init();
  68. for(int i=;i<m;i++)
  69. {
  70. int x,y,z;
  71. scanf("%d %d %d",&x,&y,&z);
  72. if(e[x][y]>z)
  73. e[x][y]=e[y][x]=z;
  74. }
  75. Dijkstra();
  76. printf("%d\n",dfs());
  77. }
  78. return ;
  79. }

HDU 1142 A Walk Through the Forest(最短路+记忆化搜索)的更多相关文章

  1. HDU 1142 A Walk Through the Forest(SPFA+记忆化搜索DFS)

    题目链接 题意 :办公室编号为1,家编号为2,问从办公室到家有多少条路径,当然路径要短,从A走到B的条件是,A到家比B到家要远,所以可以从A走向B . 思路 : 先以终点为起点求最短路,然后记忆化搜索 ...

  2. A Walk Through the Forest (最短路+记忆化搜索)

    Jimmy experiences a lot of stress at work these days, especially since his accident made working dif ...

  3. hdu 1428(很好的一道题,最短路+记忆化搜索)

    漫步校园 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submis ...

  4. UVa10917 A Walk Through the Forest(SPFA+记忆化搜索)

    题目给一张有向图,问从起点1到终点2沿着合法的路走有种走法,合法的路指从u到v的路,v到终点的距离严格小于u到终点的距离. 先SPFA预处理出所有合法的路,然后这些路肯定形成一个DAG,然后DP一下就 ...

  5. HDU 1142 A Walk Through the Forest (记忆化搜索 最短路)

    A Walk Through the Forest Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Jav ...

  6. 题解报告:hdu 1142 A Walk Through the Forest

    题目链接:acm.hdu.edu.cn/showproblem.php?pid=1142 Problem Description Jimmy experiences a lot of stress a ...

  7. UVA - 10917 - Walk Through the Forest(最短路+记忆化搜索)

    Problem    UVA - 10917 - Walk Through the Forest Time Limit: 3000 mSec Problem Description Jimmy exp ...

  8. HDU 1142 A Walk Through the Forest (求最短路条数)

    A Walk Through the Forest 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1142 Description Jimmy exp ...

  9. hdu 1142 A Walk Through the Forest

    http://acm.hdu.edu.cn/showproblem.php?pid=1142 这道题是spfa求最短路,然后dfs()求路径数. #include <cstdio> #in ...

随机推荐

  1. HDU 4489(DP)

    http://acm.hdu.edu.cn/showproblem.php?pid=4489 解题思路这里已经说的很清楚了: http://blog.csdn.net/bossup/article/d ...

  2. Java与C++区别:重载(Overloading)

    Java中一个类的函数重载可以在本类中的函数和来自父类中的函数之间进行,而C++类中的函数重载只能是本类中的(即不包括来自父类的函数),这是他们一个非常重要的区别.在其他方面的要求都是一致的,即要求函 ...

  3. Excel Metadata

    using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; usin ...

  4. BZOJ 3809Gty的二逼妹子序列 解题报告+data marker

    --BZOJ http://www.lydsy.com/JudgeOnline/problem.php?id=3809 考虑对l,r跑莫队,对一组维护美丽度出现次数的桶修改, 然后把桶序列用分块维护查 ...

  5. SEO之网站被惩罚

  6. js array copy method

    //浅拷贝: let arr=[1,2,3,4] let arr2=arr arr[3]=0 console.log(arr,arr2) //output: (4) [1, 2, 3, 0] (4) ...

  7. PHP学习笔记(二) ---- PHP数据类型

    PHP  __数据结构类型 一.php 中的八种数据类型 1.四种标量类型 Boolean (布尔类型): true  or  false,多用于条件判断. 实例: <?php $x = &qu ...

  8. jQuery瀑布流+无限加载图片

    <!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8&quo ...

  9. win7 远程连接服务器出现身份验证错误,且找不到加密Oracle修正

    用远程桌面连接登录服务器,结果,弹出一个错误的提示框:发生身份验证错误,要求的函数不受支持. 然后在网上找了相关的教程,基本上所有的方法都是如下所示: 策略路径:"计算机配置"-& ...

  10. ESP8266调试记录

    1.引脚图:使用STM32F103ZET6芯片的串口1  PA9-TX //PA10-RX(该串口挂载到APB2总线时钟)然后分别连接模块的RX和TX,供电使用3.3v(供电一定要稳)但不能超过5v ...