codeforces 786E ALT最小割 树剖+线段树优化建图

前言

我是傻逼
树剖要先搜重儿子

正文

题意：给出一颗树和若干条路径，可以花费代价1使路径合法，或者使某条边变“好”。

当一条路径经过的每条边都为“好”，那么这条路径也合法

求最小代价使所有给出的路径合法，并输出方案。

$1\le n,m\le 20000$

这是一个"二选一"求最小开销的最小割模型。

把原图中的边转化成点，把每个人和他路径上的所有边连边，容量为$inf$,人和源点连边，代价为$1$,边和汇点连边，代价也为$1$ 求最小割就是答案了。

但这样建图复杂度太高，得写个线段树+树剖优化建图

一直wa#4 答案79 我跑出来k=81 推倒重写一遍就ac了 非常迷惑

#include<bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 7, maxm = 2e6 + 7, inf = 1000000000;
#define ls p << 1
#define rs p << 1 | 1
vector<int> adj[maxn];
struct edge {
    int v, c, nxt;
}e[maxm];
int head[maxn], eid, cur[maxn], d[maxn], S, T, n, m;
void init() {memset(head, -1, sizeof(head)); eid = 0;}
void insert(int u, int v, int c) {e[eid].v = v ;e[eid].c = c; e[eid].nxt = head[u]; head[u] = eid++; e[eid].v = u; e[eid].c = 0; e[eid].nxt = head[v]; head[v] = eid++;}
bool bfs() {
    memset(d, -1, sizeof(d)); 
    queue<int> q; 
    q.push(S); d[S] = 0;
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (int i = head[u]; ~i; i = e[i].nxt) { 
            int v = e[i].v;
            if (d[v] == -1 && e[i].c) {
                d[v] = d[u]+1; 
                q.push(v);
            }
        }
    }
    return d[T] != -1;
} 
int dfs(int u, int flow) {
    int tmp, res = 0;
    if (u == T) return flow;
    for (int &i = cur[u]; ~i; i = e[i].nxt) {
        int v = e[i].v;
        if (d[v] == d[u] + 1 && e[i].c) {
            tmp = dfs(v, min(flow, e[i].c));
            res += tmp; flow -= tmp; e[i].c -= tmp; e[i^1].c += tmp; 
            if (flow == 0) break;
        }
    }
    if (flow == 0) d[u] = -1;
    return res;
}
int dinic() {
    int res = 0; 
    while (bfs()) {
        memcpy(cur, head, sizeof(cur));
        res += dfs(S, inf);
    } 
    return res;
}
int dfl[maxn], tot, siz[maxn], son[maxn], fa[maxn], idfl[maxn], dep[maxn], top[maxn];
void dfs1(int u) {
    siz[u] = 1;
    for (int i = 0; i < adj[u].size(); i++) {
        int v = adj[u][i];
        if (v != fa[u]) {
            fa[v] = u; dep[v] = dep[u] + 1; 
            dfs1(v);  
            siz[u] += siz[v];
            if (siz[son[u]] < siz[v]) son[u] = v;
        }
    }
}
void dfs2(int u, int t) {
    dfl[u] = ++tot; idfl[tot] = u; top[u] = t;
    if (son[u]) dfs2(son[u], t);
    for (int i = 0; i < adj[u].size(); i++) {
        int v = adj[u][i];
        if (v != fa[u] && v != son[u]) dfs2(v, v);
    }
}
int sgt[maxn << 2];
void build(int p, int l, int r) {
    if (l == r) {
        sgt[p] = l;
        insert(p, T, 1);
        return;
    }
    int mid = l + r >> 1;
    insert(p, ls, inf); insert(p, rs, inf);
    build (ls, l, mid); build(rs, mid + 1, r);
}
void modify(int p, int l, int r, int x, int y, int from) {
    if (x <= l && r <= y) return insert(from, p, inf);
    int mid = l + r >> 1;
    if (x <= mid) modify(ls, l, mid, x, y, from);
    if (y > mid) modify(rs, mid + 1, r, x, y, from);
}
void lca(int u, int v, int from) {
    while (top[u] != top[v]) {
        if (dep[top[u]] < dep[top[v]]) swap(u, v);
        modify(1, 1, n, dfl[top[u]], dfl[u], from);
        u = fa[top[u]];
    }
    if (dep[u] > dep[v]) swap(u, v);
    if (u != v) modify(1, 1, n, dfl[u] + 1, dfl[v], from);
}
typedef pair<int, int> pii;
map<pii, int> id;
#define mk make_pair
bool vis[maxn];
int stk[maxn];
void dfs(int u) {
    vis[u] = 1;
    for (int i = head[u]; ~i; i = e[i].nxt) {
        int v = e[i].v;
        if (e[i].c && !vis[v]) dfs(v);
    }
}
int main() {
    cin >> n >> m; init(); S = n*4+m+1; T = S + 1;
    for (int i = 1, u, v; i < n; i++) {
        cin >> u >> v;
        id[mk(u,v)] = id[mk(v,u)] = i;
        adj[u].push_back(v); adj[v].push_back(u);
    }
    dfs1(1); 
    dfs2(1, 1); 
    build(1, 1, n);
    for (int i = 1, u, v; i <= m; i++) {
        cin >> u >> v;
        insert(S, i + 4*n, 1);
        lca(u, v, i + 4*n);
    }
    printf("%d\n", dinic());
    dfs(S);
    for (int i = head[S]; ~i; i = e[i].nxt) {
        int v = e[i].v; if (!vis[v]) {
            stk[++stk[0]] = v-4*n;
        }
    }
    printf("%d ", stk[0]);
    for (int i = 1; i <= stk[0]; i++) printf("%d ", stk[i]);
    stk[0] = 0;
    for (int i = head[T]; ~i; i = e[i].nxt) {
        int v = e[i].v;
        if (vis[v]) {
            stk[++stk[0]] = id[mk(idfl[sgt[v]], fa[idfl[sgt[v]]])];
        }
    }
    printf("\n%d ", stk[0]);
    for (int i = 1; i <= stk[0]; i++) printf("%d ", stk[i]);
}

---

update:破案了 但理解不能
上述代码中的

void dfs2(int u, int t) {
    dfl[u] = ++tot; idfl[tot] = u; top[u] = t;
    if (son[u]) dfs2(son[u], t);
    for (int i = 0; i < adj[u].size(); i++) {
        int v = adj[u][i];
        if (v != fa[u] && v != son[u]) dfs2(v, v);
    }
}

如果换成

void dfs2(int u, int t) {
    dfl[u] = ++tot; top[u] = t; idfl[tot] = u;
    for (int i = 0; i < adj[u].size(); i++) {
        int v = adj[u][i];
        if (v != fa[u]) {
            if (v == son[u]) dfs2(v, t);
            else dfs2(v, v);
        }
    }
}

就会wa#4 因为树剖要先搜重儿子 不然dfs序乱了。