[BeiJing2013]压力【广义圆方树+树链剖分】

BZOJ 3331

  求每个点被作为割点的次数，于是我们可以用树链剖分直接构树然后区间维护一下即可。

  首先，圆方树使得原图变成一棵树，然后就是基础的树上查询问题了，当然，用LCA做树上差分也是可以的。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 2e5 + 7, maxM = 2e5 + 7;
int N, M, Q;
struct Graph
{
    int head[maxN], cnt;
    struct Eddge
    {
        int nex, to;
        Eddge(int a=-1, int b=0):nex(a), to(b) {}
    } edge[maxM << 1];
    inline void addEddge(int u, int v)
    {
        edge[cnt] = Eddge(head[u], v);
        head[u] = cnt++;
    }
    inline void _add(int u, int v) { addEddge(u, v); addEddge(v, u); }
    inline void init()
    {
        cnt = 0;
        for(int i=1; i<=N; i++) head[i] = -1;
    }
} Old, Now;
int dfn[maxN], tot, low[maxN], Stap[maxN], Stop, Bcnt;
void Tarjan(int u, int fa)
{
    dfn[u] = low[u] = ++tot;
    Stap[++Stop] = u;
    for(int i=Old.head[u], v, p; ~i; i=Old.edge[i].nex)
    {
        v = Old.edge[i].to;
        if(v == fa) continue;
        if(!dfn[v])
        {
            Tarjan(v, u);
            low[u] = min(low[u], low[v]);
            if(low[v] >= dfn[u])
            {
                Bcnt++; Now.head[Bcnt + N] = -1;
                do
                {
                    p = Stap[Stop--];
                    Now._add(p, N + Bcnt);
                } while(p ^ v);
                Now._add(u, N + Bcnt);
            }
        }
        else low[u] = min(low[u], dfn[v]);
    }
}
int siz[maxN], Wson[maxN], deep[maxN], fa[maxN];
void dfs_1(int u, int father)
{
    deep[u] = deep[father] + 1; siz[u] = 1; fa[u] = father;
    int maxx = 0;
    for(int i=Now.head[u], v; ~i; i=Now.edge[i].nex)
    {
        v = Now.edge[i].to;
        if(v == father) continue;
        dfs_1(v, u);
        if(siz[v] > maxx)
        {
            maxx = siz[v];
            Wson[u] = v;
        }
        siz[u] += siz[v];
    }
}
int top[maxN], id[maxN], _Index;
void dfs_2(int u, int topy)
{
    top[u] = topy; id[u] = ++_Index;
    if(Wson[u]) dfs_2(Wson[u], topy);
    for(int i=Now.head[u], v; ~i; i=Now.edge[i].nex)
    {
        v = Now.edge[i].to;
        if(v == fa[u] || v == Wson[u]) continue;
        dfs_2(v, v);
    }
}
struct BIT_Tree
{
    int tree[maxN << 2];
    inline void pushdown(int rt)
    {
        if(tree[rt])
        {
            tree[lsn] += tree[rt]; tree[rsn] += tree[rt];
            tree[rt] = 0;
        }
    }
    void update(int rt, int l, int r, int ql, int qr)
    {
        if(ql <= l && qr >= r) { tree[rt] ++; return; }
        int mid = HalF; pushdown(rt);
        if(qr <= mid) update(QL);
        else if(ql > mid) update(QR);
        else { update(QL); update(QR); }
    }
    int query(int rt, int l, int r, int qx)
    {
        if(l == r) return tree[rt];
        int mid = HalF; pushdown(rt);
        if(qx <= mid) return query(Lson, qx);
        else return query(Rson, qx);
    }
    inline void up_Range(int u, int v)
    {
        while(top[u] ^ top[v])
        {
            if(deep[top[u]] < deep[top[v]]) swap(u, v);
            update(1, 1, N + Bcnt, id[top[u]], id[u]);
            u = fa[top[u]];
        }
        if(deep[u] < deep[v]) swap(u, v);
        update(1, 1, N + Bcnt, id[v], id[u]);
    }
} tree;
inline void init()
{
    tot = Bcnt = Stop = _Index = 0;
    Old.init(); Now.init();
}
int main()
{
    scanf("%d%d%d", &N, &M, &Q); init();
    for(int i=1, u, v; i<=M; i++)
    {
        scanf("%d%d", &u, &v);
        Old._add(u, v);
    }
    for(int i=1; i<=N; i++) if(!dfn[i]) Tarjan(i, 0);
    dfs_1(1, 0);
    dfs_2(1, 1);
    int x, y;
    while(Q--)
    {
        scanf("%d%d", &x, &y);
        tree.up_Range(x, y);
    }
    for(int i=1; i<=N; i++) printf("%d\n", tree.query(1, 1, N + Bcnt, id[i]));
    return 0;
}
/*
4 4 2
1 2
1 3
2 3
1 4
4 2
4 3
*/