Uva10917 林中漫步 最短路+DAG上dp

蓝书330 DAG上的dp， 注意输出路径条数时的dfs函数 if(i == 终点) return 1 如果dis[u] > dis[v],

则dfs(v), 并且d[u] += d[v]

// Decline is inevitable
// Romance will last forever
// UVA 10917
#include <bits/stdc++.h>
#define mst(a, x) memset(a, x, sizeof(a))
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 1e3 + 10;
const int maxm = 1e6 + 10;
int n, m, head[maxn], cnt;  //建图
bool vis[maxn];
int dis[maxn];
int d[maxn]; //方案数
struct Edge {
    int to, dis, next;
}edge[maxm];
struct node {
    int dis;
    int pos;
    node(int dis = 0, int pos = 0) : dis(dis), pos(pos) {}
    bool operator < (const node &x)const {
        return dis > x.dis;
    }
};
void add_edge(int u, int v, int w) {
    cnt++;
    edge[cnt].to = v;
    edge[cnt].dis = w;
    edge[cnt].next = head[u];
    head[u] = cnt;
}
priority_queue<node> q;
void dijkstra(int s) {
    mst(vis, false);
    mst(dis, 0x3f);
    while(!q.empty()) q.pop();
    dis[s] = 0;
    q.push(node(0, s));
    while(!q.empty()) {
        node tmp = q.top();
        q.pop();
        int x = tmp.pos;
        if(vis[x]) continue;
        vis[x] = 1;
        for(int i = head[x]; i; i = edge[i].next) {
            int y = edge[i].to;
            if(dis[y] > dis[x] + edge[i].dis)
                dis[y] = dis[x] + edge[i].dis;
            if(!vis[y])
                q.push(node(dis[y], y));
        }
    }
}
int dfs(int i) {
    if(i == 2) return 1;
    if(d[i]) return d[i];
    int ans = 0;
    for(int j = head[i]; j; j = edge[j].next) {
        if(dis[i] > dis[edge[j].to])
            ans += dfs(edge[j].to);
    }
    return d[i] = ans;
}
int main() {
    while(scanf("%d%d", &n, &m) && n) {
        cnt = 0;
        mst(head, 0);
        mst(d, 0);
        for(int i = 0; i < m; i++) {
            int u, v, w;
            cin >> u >> v >> w;
            add_edge(u, v, w);
            add_edge(v, u, w);
        }
        dijkstra(2);
        cout << dfs(1) << endl;
    }
    return 0;
}

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
Output for Sample Input

2
4