图算法—Problem J
题意
题目大意是给一个图。起点为1,终点为2;然后点a到点b是合法的判断是当b存在一个到终点的距离小于a到终点的最小距离。求从起点到终点的路径数。
解题思路
我的做法是dijk +DFS。具体为:
1、以终点 2 为起点 dijkstra;
2、直接DFS记忆化搜索。
感想
已经做不动了······
AC代码
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAX 1000000
#define N 1010
int num, road, map[N][N], dis[N], dp[N];
bool visit[N];
void Dijkstra(int start)
{
int temp, k;
memset(visit, 0, sizeof(visit));
for(int i = 1; i <= num; ++i)
dis[i] = map[start][i];
dis[start] = 0;
visit[start] = 1;
for(int i = 1; i <= num; ++i)
{
temp = MAX;
for(int j = 1; j <= num; ++j)
if(!visit[j] && temp > dis[j])
temp = dis[k = j];
if(temp == MAX) break;
visit[k] = 1;
for(int j = 1;j <= num; ++j)
if(!visit[j] && dis[j] > dis[k] + map[k][j])
dis[j] = dis[k] + map[k][j];
}
}
int DFS(int v)
{
int sum = 0;
if(dp[v] != -1) return dp[v];
if(v == 2) return 1;
for(int i = 1; i <= num; ++i) //v到i有路且v到终点距离大于i到终点的距离
if(map[v][i] != MAX && dis[v] > dis[i])
sum += DFS(i);//路径条数累加
dp[v] = sum;
return dp[v]; //找到的所有路径的结果
}
int main()
{
int x, y, cost;
while(scanf("%d", &num) != EOF && num)
{
scanf("%d", &road);
for(int i = 1; i <= num; ++i)
{
dp[i] = -1;
for(int j = 1; j <= num; ++j)
map[i][j] = MAX;
}
for(int i = 1; i <= road; ++i)
{
scanf("%d%d%d", &x, &y, &cost);
map[x][y] = map[y][x] = cost;
}
Dijkstra(2); //终点开始最短路
printf("%d\n", DFS(1)); //起点深搜,得到满足题意路径条数
}
return 0;
}