【BZOJ3876】【AHOI/JSOI2014】分支剧情（有源汇有上下界最小费用最大流）

Descriptionn

给定一张DAG，每条边有边权，每次只能从第一个点出发沿着拓扑图走一条路径，求遍历所有边所需要的最小边权和。
（感觉原题题意很迷啊）

---

Solution

对于每一条边下界为1搞费用流即可。

开始在在BZOJ上AC了，然后洛谷T成了70分，卡了半天常数也只有90分。
发现其他的dalao每个点只需要二十几ms，而我要九百多ms QAQ
然后将费用为1的边先加上贡献，然后将边合并，就只要二十几ms辣

上下界网络流优化的效果很兹磁啊（难怪我的LOJ上的板子排到了倒数第二版）

---

Code

/************************************************
 * Au: Hany01
 * Date: Jul 21st, 2018
 * Prob: [BZOJ3876][AHOI2014][JSOI2014] 支线剧情
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#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 Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#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 INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

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; }

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

const int maxn = 307, maxm = (maxn * 50) << 3;

int n, s, t, S, T, beg[maxn], v[maxm], nex[maxm], w[maxm], f[maxm], e = 1, Cost, dis[maxn], vis[maxn], deg[maxn], mn[maxn][maxn];

inline void add(int uu, int vv, int ff, int ww) {
    v[++ e] = vv, w[e] = ww, f[e] = ff, nex[e] = beg[uu], beg[uu] = e;
    v[++ e] = uu, w[e] = -ww, nex[e] = beg[vv], beg[vv] = e;
}

int DFS(int u, int flow) {
    if (u == T) return flow;
    int t, res = flow; vis[u] = 1;
    for (register int i = beg[u]; i; i = nex[i])
        if (f[i] && dis[v[i]] == dis[u] + w[i] && !vis[v[i]]) {
            f[i] -= (t = DFS(v[i], min(res, f[i]))), f[i ^ 1] += t, Cost += t * w[i];
            if (!(res -= t)) return flow;
        }
    return flow - res;
}

int main()
{
#ifdef hany01
    File("bzoj3876");
#endif

    static int vv, ww;

    n = read(), s = 1, T = (S = (t = n + 1) + 1) + 1, Set(mn, 127);
    For(i, 1, n) {
        for (register int ki = read(); ki --; )
            vv = read(), Cost += ww = read(), chkmin(mn[i][vv], ww), ++ deg[i], -- deg[vv];
        add(i, t, INF, 0);
    }
    For(i, 1, n) if (deg[i] > 0) add(i, T, deg[i], 0); else add(S, i, -deg[i], 0);
    For(i, 1, n) For(j, 1, n) if (mn[i][j] != 0x7f7f7f7f) add(i, j, INF, mn[i][j]);
    add(t, s, INF, 0);

    for ( ; ; ) {
        static queue<int> q;
        Set(dis, 127), Set(vis, 0), dis[S] = 0, q.push(S);
        while (!q.empty()) {
            int u = q.front(); q.pop(), vis[u] = 0;
            for (register int i = beg[u]; i; i = nex[i])
                if (f[i] && chkmin(dis[v[i]], dis[u] + w[i]))
                    if (!vis[v[i]]) vis[v[i]] = 1, q.push(v[i]);
        }
        if (dis[T] == 0x7f7f7f7f) break;
        DFS(S, INF);
    }
    printf("%d\n", Cost);

    return 0;
}
//山不在高，有林则徐。水不在深，有江则明。
//    -- 刘禹锡《陋室铭》