hdu 1142A Walk Through the Forest
来源:互联网 发布:飞鹰网络电视直播软件 编辑:程序博客网 时间:2024/05/20 11:24
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
这道题很关键的是读懂题意,不是简单的求两点之间的最短距离,而是求满足要求的路径的条数,要求就是如果要从A到B,那么存在一条B到home的路径route(A到home的任何路径
都大于这条route),即A到home的最短路径大于B到home的最短路径。思路就是用dijstra算法算出home到各个结点的最短路径,作为判断条件进行记忆化搜索,直接dfs会tle。
ps:(本人弱鸡,记忆化搜索还不太熟,下篇博客详细介绍记忆化搜索)
#include<iostream>#include<cstring>using namespace std;#define INF 0x3f3f3f3fint map[1001][1001];int d[1001];int s[1001];int path[1001];int m,n;void dij(){ int i,j,v,min; for(i=1;i<=m;i++){ s[i]=0; d[i]=map[2][i]; } for(i=1;i<=m;i++){ min=INF; for(j=1;j<=m;j++){ if(s[j]==0&&d[j]<min){ min=d[j]; v=j; } } s[v]=1; for(j=1;j<=m;j++){ if(s[j]==0&&d[j]>d[v]+map[v][j]) d[j]=d[v]+map[v][j]; } }}int dfs(int i){ int sum=0,k; if(path[i]) return path[i]; if(i==2) return 1; for(k=1;k<=m;k++){ if(map[i][k]<INF&&d[i]>d[k]){ if(path[k])sum=sum+path[k]; else sum=sum+dfs(k); } } sum=sum+path[i]; path[i]=sum; return path[i];}int main(){ int i,j,a,b,c; while(cin>>m>>n&&m!=0){ for(i=1;i<=m;i++){ for(j=1;j<=m;j++){ if(i==j) map[i][j]=map[j][i]=0; else map[i][j]=map[j][i]=INF; } } for(i=1;i<=n;i++){ cin>>a>>b>>c; if(map[a][b]>c) map[a][b]=map[b][a]=c; } memset(path,0,sizeof(path)); dij(); cout<<dfs(1)<<endl; }}
阅读全文
0 0
- HDU 1142 A Walk Through the Forest
- A Walk Through the Forest HDU 1142
- hdu 1142 A Walk Through the Forest
- Hdu-1142 A Walk Through the Forest
- hdu 1142 A Walk Through the Forest
- HDU 1142 A Walk Through the Forest
- HDU 1142 A Walk Through the Forest
- hdu 1142 A Walk Through the Forest
- HDU 1142 A Walk Through the Forest
- HDU 1142 A Walk Through the Forest
- HDU 1142 A Walk Through the Forest
- hdu 1142 A Walk Through the Forest
- hdu 1142 A Walk Through the Forest
- hdu 1142 A Walk Through the Forest
- hdu 1142 A Walk Through the Forest
- HDU 1142 A Walk Through the Forest
- hdu 1142 A Walk Through the Forest
- hdu 1142 A Walk Through the Forest
- 迅雷2018笔试——有符号整数反转
- JQuery 淡出、 动画、显示/隐藏切换等效果
- 1/1-1/2+1/3-1/4···+1/99-1/100的值
- 多元函数为凸函数的充要条件为其二阶Hessian矩阵半正定
- struct和typedef struct的用法以及在C/C++中的区别
- hdu 1142A Walk Through the Forest
- 浅析电商项目中的安全问题
- 读书笔记20170919
- 用Shell判断字符串包含关系的方法小结
- MATLAB匿名函数
- zxing实现二维码生成
- 了解汇编语言之寄存器
- CSS 各种选择器
- 内容提供者ContentProvider和内容解析者ContentResolver