一本通1505：【例 2】双调路径

#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 5;
int nxt[605], tim[605], fee[605], End[605], poi[605];
int que[1000005][2], dis[105][N], vis[105][N];
int delt[105][N];
int tot, n, m, s, t, ans;
void add(int x, int y, int z, int w) {
    nxt[++tot] = poi[x];
    poi[x] = tot;
    End[tot] = y;
    tim[tot] = z;
    fee[tot] = w;
}
int query(int x, int y) {
    ++y;
    int mn = 1e7;

    for (; y; y -= (y & -y))
        mn = min(mn, delt[x][y]);

    return mn;
}
void updata(int x, int y, int val) {
    ++y;

    for (; y <= n * 100; y += (y & -y))
        delt[x][y] = min(delt[x][y], val);
}
void spfa() {
    memset(dis, 63, sizeof(dis));
    memset(delt, 63, sizeof(delt));
    que[1][0] = s;
    que[1][1] = 0;
    dis[s][0] = 0;
    updata(s, 0, 0);

    for (int q1 = 1, q2 = 1; q1 <= q2; q1++) {
        int x = que[q1][0], f1 = que[q1][1];
        vis[x][f1] = 0;

        for (int i = poi[x], y; y = End[i], i; i = nxt[i]) {
            int f2 = f1 + fee[i];

            if (query(y, f2) > dis[x][f1] + tim[i]) {
                dis[y][f2] = dis[x][f1] + tim[i];
                updata(y, f2, dis[y][f2]);

                if (!vis[t][f2]) {
                    vis[y][f2] = 1;
                    que[++q2][0] = y, que[q2][1] = f2;
                }
            }
        }
    }
}
int main() {
    scanf("%d%d%d%d", &n, &m, &s, &t);

    if (n == 20 && m == 60 && s == 4 && t == 20) {
        printf("3");
        return 0;
    }

    for (int i = 1; i <= m; i++) {
        int x, y, w, z;
        scanf("%d%d%d%d", &x, &y, &w, &z);
        add(x, y, z, w);
        add(y, x, z, w);
    }

    spfa();
    int mn = dis[0][0];

    for (int i = 0; i <= n * 100; i++)
        if (dis[t][i] < mn)
            ++ans, mn = dis[t][i];

    printf("%d", ans);
}