A Walk Through the Forest
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5809 Accepted Submission(s): 2147
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 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
解题思路:给定一个无向图,从A能走到B当且仅当从B走到终点的最短距离小于从A走到终点的最短距离,问有多少条可选择的路径,首先spfa一下跑出以终点为根的最短路径树,然后用记忆化搜索搞一下dp[x]代表以x为起点的路径条数,输出dp[1]即可
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define Inf 999999999
using namespace std;
int head[1005],k,dis[1005],dp[1005];
struct
{
int e;
int w;
int next;
}edge[1000005];
void add(int s,int e,int w)
{
edge[k].e=e;
edge[k].w=w;
edge[k].next=head[s];
head[s]=k++;
}
void spfa(int n)
{
int i,st,ed;
bool visit[1005];
queue<int> x;
memset(visit,false,sizeof(visit));
for(i=1;i<=n;i++)
dis[i]=Inf;
dis[2]=0;
x.push(2);
while(!x.empty())
{
st=x.front();
x.pop();
visit[st]=false;
for(i=head[st];i!=-1;i=edge[i].next)
{
ed=edge[i].e;
if(dis[st]+edge[i].w<dis[ed])
{
dis[ed]=dis[st]+edge[i].w;
if(!visit[ed])
{
visit[ed]=true;
x.push(ed);
}
}
}
}
}
int dfs(int x)
{
int i,ed;
if(dp[x])
return dp[x];
if(x==2)
return 1;
int sum=0;
for(i=head[x];i!=-1;i=edge[i].next)
{
ed=edge[i].e;
if(dis[ed]<dis[x])
sum+=dfs(ed);
}
dp[x]=sum;
return sum;
}
int main()
{
int m,n,a,b,c;
while(scanf("%d",&n),n)
{
k=0;
memset(head,-1,sizeof(head));
memset(dp,0,sizeof(dp));
scanf("%d",&m);
while(m--)
{
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);
add(b,a,c);
}
spfa(n);
dfs(1);
printf("%d\n",dp[1]);
}
return 0;
}