NOIP2017 逛公园 (拓扑，dp，最短路)

Description

click me

Solution

先从起点和终点各一遍最短路（spfa或者Dijkstra的堆优化），然后拓扑，如果一个点在零环上且到起点、终点的距离之和符合题目要求，输出-1，否则dp：
设$dp_{i,j}$为到第$i$个点、路径长度为最短路$+j$的方案数，转移应该非常显然了吧

Code

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef set<int> SI;
typedef set<int>::iterator siit;
#define For(i , j , k) for (register int i = (j) , i##_end_ = (k) ; i <= i##_end_ ; ++ i)
#define Fordown(i , j , k) for (register int i = (j) , i##_end_ = (k) ; i >= i##_end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define fir first
#define sec second
#define pc putchar
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#ifdef hany01
#define debug(...) fprintf(stderr , __VA_ARGS__)
#else
#define debug(...)
#endif

template <typename T> inline bool chkmax(T &a , T b) { return a < b ? (a = b , 1) : 0; }
template <typename T> inline bool chkmin(T &a , T b) { return b < a ? (a = b , 1) : 0; }

int _ , __;
char c_;
inline int read()
{
    for (_ = 0 , __ = 1 , c_ = getchar() ; !isdigit(c_) ; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; isdigit(c_) ; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("park.in" , "r" , stdin);
    freopen("park.out" , "w" , stdout);
#endif
}

const int maxn = 100005, maxm = 200005, maxk = 53;

int n, m, k, Mod, beg1[maxn], nex1[maxm], v1[maxm], w1[maxm], beg2[maxn], nex2[maxm], v2[maxm], w2[maxm], dis1[maxn], dis2[maxn], d[maxn], q[maxn << 2], cnt, e1, e2, dp[maxn][maxk], T, head, tail;
bool vis[maxn];

inline void add1(int uu, int vv, int ww) { v1[++ e1] = vv; w1[e1] = ww; nex1[e1] = beg1[uu]; beg1[uu] = e1; }
inline void add2(int uu, int vv, int ww) { v2[++ e2] = vv; w2[e2] = ww; nex2[e2] = beg2[uu]; beg2[uu] = e2; }

inline void mod(int &x) { if (x >= Mod) x -= Mod; }

inline void Init()
{
    int uu, vv, ww;
    n = read(); m = read(); k = read(); Mod = read();
    Set(beg1, 0); Set(beg2, 0); e1 = e2 = 0; Set(d, 0); Set(dp, 0);
    while (m --) uu = read(), vv = read(), ww = read(), add1(uu, vv, ww), add2(vv, uu, ww);
}

inline void SPFA1()
{
    q[head = tail = 1] = 1;
    Set(dis1, 127); dis1[1] = 0;
    while (head <= tail) {
        register int u = q[head]; vis[u] = 0; ++ head;
        for (register int i = beg1[u]; i; i = nex1[i]) if (chkmin(dis1[v1[i]], dis1[u] + w1[i]) && !vis[v1[i]]) q[++ tail] = v1[i], vis[v1[i]] = 1;
    }
}

inline void SPFA2()
{
    q[head = tail = 1] = n;
    Set(dis2, 127); dis2[n] = 0;
    while (head <= tail) {
        register int u = q[head]; vis[u] = 0; ++ head;
        for (register int i = beg2[u]; i; i = nex2[i]) if (chkmin(dis2[v2[i]], dis2[u] + w2[i]) && !vis[v2[i]]) q[++ tail] = v2[i], vis[v2[i]] = 1;
    }
}

inline void Pickout()
{
    For(u, 1, n) for (register int i = beg1[u]; i; i = nex1[i]) if (dis1[v1[i]] == dis1[u] + w1[i]) ++ d[v1[i]];
    cnt = 0;
    For(i, 1, n) if (!d[i]) q[++ cnt] = i;
    for (register int i = 1; i <= cnt; ++ i) {
        register int u = q[i];
        for (register int j = beg1[u]; j; j = nex1[j]) if (dis1[v1[j]] == dis1[u] + w1[j] && !(-- d[v1[j]])) q[++ cnt] = v1[j];
    }
}

inline bool Assert() {
    For(i, 1, n) if (d[i] && dis1[i] + dis2[i] <= dis1[n] + k) { puts("-1"); return 1; }
    return 0;
}

inline void DP()
{
    dp[1][0] = 1;
    For(K, 0, k) {
        For(i, 1, cnt) for (register int j = beg1[q[i]]; j; j = nex1[j])
            if (dis1[v1[j]] == dis1[q[i]] + w1[j]) mod(dp[v1[j]][K] += dp[q[i]][K]);
        For(u, 1, n) for (register int j = beg1[u]; j; j = nex1[j])
            if (dis1[v1[j]] < dis1[u] + w1[j] && K - dis1[v1[j]] + dis1[u] + w1[j] <= k) mod(dp[v1[j]][K - dis1[v1[j]] + dis1[u] + w1[j]] += dp[u][K]);
    }
}

inline void Print()
{
    int Ans = 0;
    For(K, 0, k) mod(Ans += dp[n][K]);
    printf("%d\n", Ans);
}

int main()
{
    File();

    T = read();
    while (T --) {

        Init();

        SPFA1();

        SPFA2();

        Pickout();

        if (Assert()) continue;

        DP();

        Print();

    }

    return 0;
}
//凄凉宝剑篇，羁泊欲穷年。
//黄叶仍风雨，青楼自管弦。
//新知遭薄俗，旧好隔良缘。
//心断新丰酒，销愁又几千。
//--李商隐《风雨》