hdu 1142 最短路径+dfs记忆化搜索
来源:互联网 发布:手机卡 非实名 淘宝 编辑:程序博客网 时间:2024/05/29 07:20
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
寻找一共有多少条符合题意从1到2的路。能够从点A走到点B的要求是:点A到终点的最短路 > 点B到终点的最短路。 也就是说:从终点出发,求每一个点的最短路,然后那些最短路的值记录起来,作为能否通过的判断条件
#include<iostream>#include<cstring>#include<cmath>#include<cstdio>#include<queue>#include<map>#include<vector>#include<cstdlib>#include<algorithm>#define inf 0x3f3f3f3f#define LL long longusing namespace std;int n,m;vector<int> g[1010];bool visited[1010];int dist[1010];int w[1010][1010];int dp[1010];int dfs(int cur){ if(dp[cur]!=-1) return dp[cur];//递归求解某个数组的值的时候必然要用到记忆化搜索 if(cur==2) return dp[cur]=1; int sumx=0; for(int i=0;i<g[cur].size();i++) if(dist[cur]>dist[g[cur][i]]) { sumx+=dfs(g[cur][i]); } return dp[cur]=sumx;}int main(){ while(cin>>n) { if(n==0) return 0; cin>>m; memset(w,0x3f,sizeof(w)); for(int i=0;i<=1009;i++) g[i].clear(); for(int i=1;i<=m;i++) { int a,b,d; cin>>a>>b>>d; w[a][b]=w[b][a]=d; g[a].push_back(b); g[b].push_back(a); } memset(visited,0,sizeof(visited)); memset(dist,0x3f,sizeof(dist)); dist[2]=0; for(int i=1;i<=n;i++) { int x,m=inf; for(int j=1;j<=n;j++) if(!visited[j]&&dist[j]<m) { m=dist[j]; x=j; } visited[x]=1; for(int j=1;j<=n;j++) if(!visited[j]) dist[j]=min(dist[j],dist[x]+w[x][j]); } memset(dp,-1,sizeof(dp));//记忆化出始 LL sum=dfs(1); cout<<sum<<endl; } return 0;}
0 0
- hdu 1142 最短路径+dfs记忆化搜索
- hdu 2833 WuKong(最短路径+记忆化搜索)
- HDU--1142--A Walk Through the Forest--深广搜/DP/最短路径/记忆化搜索
- HDU-1142 A Walk Through the Forest(最短路径+记忆化搜索)
- HDU--1428--漫步校园--搜索/最短路径/记忆化搜索
- HDU 1248 漫步校园【记忆化搜索+优先队列+最短路径dijkstra算法综合运用】
- HDU 1142 A Walk Through the Forest(spfa最短路+dfs记忆化搜索)
- HDU-1142(最短路+记忆化搜索)
- HDU-1142-最短路+记忆化搜索
- 最短路径 记忆路径
- 最短路径Dijkstra(静态邻接表+优先队列模板)+ 记忆化搜索
- POJ 1661Help Jimmy(逆向DP Or 记忆化搜索 Or 最短路径)
- HDU-1501 Zipper DFS+记忆化搜索
- hdu 1078 dfs+记忆化搜索
- hdu 机器人路径 dp+记忆化搜索
- DFS+记忆搜索-HDU-1078
- hdu 最短路径
- hdu 最短路径
- 不用工具就可以在虚拟机安好系统后,并只有c盘的情况下增加分区
- 解决android-Ultra-Pull-To-Refresh 和ViewPager冲突的问题
- 获得执行jar的运行路径
- 中国大陆CDN的测量与分析
- Labview队列操作
- hdu 1142 最短路径+dfs记忆化搜索
- 一个TextView显示多个颜色
- R语言︱构造新序列
- Linux操作提示:“Cant open file for writing”或“operation not permitted”的解决办法
- Login failed:make sure your username and password are correct and that you’re an admin or moderator
- ViewPager无限自动轮播
- innerHTML和innerText的区别
- REST服务学习笔记一、基于JAX-RS 2.0 REST服务几种类型
- python glob fnmatch 用于文件查找操作