HDU 1142 A Walk Through the Forest (dijkstra+记忆化搜索)
来源:互联网 发布:知我药妆网 编辑:程序博客网 时间:2024/04/28 16:43
A Walk Through the Forest
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7598 Accepted Submission(s): 2794
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.
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
http://acm.hdu.edu.cn/showproblem.php?pid=1142
// dijkstra 加 记忆化搜索
#include<stdio.h>#include<string.h>int ap[1010][1010],dis[1010],vis[1010],dp[1010];const int inf=0x3f3f3f3f;int n,m;int dfs(int qd){ int i; if(dp[qd]>0) return dp[qd]; for(i=1; i<=n; i++) { if(dis[i]<dis[qd]&&ap[qd][i]<inf) dp[qd]=dp[qd]+dfs(i); } return dp[qd];}int main(){ int i,j,k,a,b,c,flag; while(scanf("%d",&n)!=EOF) { if(n==0) break; scanf("%d",&m); for(i=1; i<=n; i++) for(j=1; j<=n; j++) { if(j==i) ap[i][j]=ap[i][j]=0; else ap[i][j]=ap[i][j]=inf; } for(i=1; i<=m; i++) { scanf("%d %d %d",&a,&b,&c); ap[a][b]=ap[b][a]=c; } memset(vis,0,sizeof(vis)); dis[2]=0; vis[2]=1; for(i=1; i<=n; i++) dis[i]=ap[2][i]; int MIN,u; for(i=1; i<=n; i++) { MIN=inf; for(j=1; j<=n; j++) if(vis[j]==0&&MIN>dis[j]) { MIN=dis[j]; u=j; } vis[u]=1; for(j=1; j<=n; j++) if(vis[j]==0) if(ap[u][j]<inf) if(dis[j]>ap[u][j]+dis[u]) dis[j]=ap[u][j]+dis[u]; } memset(dp,0,sizeof(dp)); dp[2]=1; printf("%d\n",dfs(1)); } return 0;}
0 0
- hdu 1142 A Walk Through the Forest Dijkstra+记忆搜索
- hdu 1142 A Walk Through the Forest (Dijkstra + 记忆化搜索)
- HDU 1142 A Walk Through the Forest (Dijkstra + 记忆化搜索 好题)
- HDU 1142 A Walk Through the Forest (记忆化搜索+Dijkstra算法)
- HDU 1142 A Walk Through the Forest (dijkstra+记忆化搜索)
- HDU 1142 A Walk Through the Forest【记忆化搜索+最短路Dijkstra算法】
- HDU 1142 A Walk Through the Forest (dijkstra+记忆化搜索)
- 【Dijkstra+DFS(记忆化)】hdu 1142 A Walk Through the Forest(外:hdu 1428)
- ZOJ Walk Through the Forest (dijkstra + BFS || 记忆化搜索)
- UVA 10917 Walk Through the Forest (dijkstra+记忆化搜索)
- hdu 1142 A Walk Through the Forest (最短路 + 记忆化搜索)
- hdu 1142 A Walk Through the Forest(spfa求最短路+记忆化搜索)
- HDU 1142 A Walk Through the Forest (SPFA+记忆化搜索)
- 【HDU】1142 A Walk Through the Forest 最短路+记忆化搜索
- HDU--1142--A Walk Through the Forest--深广搜/DP/最短路径/记忆化搜索
- hdu-1142-A Walk Through the Forest-最短路+记忆化搜索
- HDU 1142 A Walk Through the Forest(spfa最短路+dfs记忆化搜索)
- hdu 1142 A Walk Through the Forest(最短路+记忆化搜索)
- 豆绿色设置
- centos 7 升级/安装 git 2.7.3
- 查漏补缺——顺序容器(C++ Primer)
- vim常用指令
- C++基础:引用
- HDU 1142 A Walk Through the Forest (dijkstra+记忆化搜索)
- UOJ#213——【UNR #1】争夺圣杯
- python中的异常的理解
- 记录Maven和Mybatis整合时打包漏掉mapper的xml文件及其它资源
- c++学习1
- 色光三原色
- 关于浏览器和网络的20项须知-HTML5
- POJ-2676 Sudoku(DFS)
- swift 学习笔记三