hdu1142A Walk Through the Forest (最短路+BFS+DFS )
来源:互联网 发布:界面设计软件 编辑:程序博客网 时间:2024/06/06 01:43
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有路,并且A到终点的最小距离大于B到终点的最小距离,问有多少种走法。思路:先从终点出发,把每一点到终点的距离算出来,然后主要在DFS上,算出每一点有多少种走法,有DP思想。#include<stdio.h>#include<iostream>#include<queue>using namespace std;typedef struct n1{ int distens,flog; //friend bool operator<(n1 n,n1 nn) //{ // return nn.distens<n.distens; //}}node;node N[1005];int map[1005][1005],k;int direct[1005];void set(int n){ int i,j,m,n1,n2,d; for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { map[i][j]=-1; } N[i].distens=10000000;N[i].flog=0;direct[i]=0; } scanf("%d",&m); while(m--) { scanf("%d%d%d",&n1,&n2,&d); if(map[n1][n2]!=0||map[n1][n2]>d) map[n1][n2]=map[n2][n1]=d; }}void BFS(int n){ queue<int> Q; int now; int i; N[2].distens=0;N[2].flog=1; Q.push(2); while(!Q.empty())//算出每个点到终到的最小距离 { now=Q.front(); Q.pop(); N[now].flog=0; //if(q.x==1)break; for(i=1;i<=n;i++) if(map[now][i]!=-1) { if(N[i].distens>N[now].distens+map[now][i]) { N[i].distens=N[now].distens+map[now][i]; if(N[i].flog==0) { N[i].flog=1; Q.push(i); } } } }}int DFS(int now,int n){ int i; if(direct[now]>0)//direct表示当前点到终点有多少种走法,为了下次搜到这个点就不必往下搜了,直接反回 return direct[now]; if(now==2) { return 1; } for(i=1;i<=n;i++) if(map[now][i]!=-1&&N[now].distens>N[i].distens) { direct[now]+=DFS(i,n); } return direct[now];}int main(){ int n; while(scanf("%d",&n)>0&&n) { set(n); BFS(n); k=DFS(1,n); printf("%d\n",k); }}
- hdu1142A Walk Through the Forest (最短路+BFS+DFS )
- 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 (最短路+dfs )
- hdu1142A Walk Through the Forest(spfa+dfs+标记,题目意思要注意)
- 【最短路+dfs+dijkstra】杭电 hdu 1142 A Walk Through the Forest
- A Walk Through the Forest 最短路+记忆化搜索DFS
- hdu1142 A Walk Through the Forest 最短路和记忆式搜索dijstra+dfs
- hdu 1142 A Walk Through the Forest【Dijkstra+dfs求最短路条数】
- 杭电1142 A Walk Through the Forest (最短路+DFS+dp)
- HDU 1142 A Walk Through the Forest(spfa最短路+dfs记忆化搜索)
- A Walk Through the Forest 最短路+dp
- Uva 10917 - Walk Through the Forest 最短路
- hdu 1142 A Walk Through the Forest 最短路
- UVA 10917 Walk Through the Forest(最短路+dp)
- 【UVa】10917 A Walk Through the Forest 最短路+DP
- 839 - Not so Mobile
- android中进行https连接的方式
- HttpURLConnection POST/GET 处理方式
- poj 3050 搜索
- linux 操作系统的page fault处理
- hdu1142A Walk Through the Forest (最短路+BFS+DFS )
- HDU--1455 -- Sticks [DFS] [剪枝优化]
- uva 540
- Uva11489 Integer Game
- 《启示录》读书笔记系列--笔记十
- Java实现的一个旋转效果(旋转太极)
- bootloader
- POJ1185+状态压缩DP
- VIM列编辑