【BZOJ2002】【HNOI2010】弹飞绵羊（LCT）

Description

click me

Solution

根据从每个点所能跳到的点连边，若被弹出，则连到一个新建节点$n+1$，对于弹力系数的更改用LCT实现，每次询问时使该节点成为根，再$access(n + 1)$，然后$splay(x)$，求$size[x]$即可。

Code

/*****************
Au: Hany01
Date: Dec 31th, 2017
Prob: bzoj2002 & hnoi2010 bounce
Email: hany01@foxmail.com
*****************/

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define rep(i , j) for (int i = 0 , i##_end_ = j; i < i##_end_ ; ++ i)
#define For(i , j , k) for (int i = (j) , i##_end_ = (k) ; i <= i##_end_ ; ++ i)
#define Fordown(i , j , k) for (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 INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#ifdef hany01
#define debug(...) fprintf(stderr , __VA_ARGS__)
#else
#define debug(...)
#endif

#define judge(x) ((x) > n ? (n + 1) : (x))

inline void File()
{
#ifdef hany01 
    freopen("bzoj2002.in" , "r" , stdin);
    freopen("bzoj2002.out" , "w" , stdout);
#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; }

char c_; int _ , __;
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 _ * __;
}

const int maxn = 200005;

#define dir(x) (*ch[fa[x]] != x)
#define isrt(x) (*ch[fa[x]] != (x) && ch[fa[x]][1] != x)

int n, k[maxn];

struct LCT
{
    int fa[maxn], ch[maxn][2], sz[maxn], rev[maxn];

    inline void maintain(int o) { sz[o] = sz[ch[o][0]] + sz[ch[o][1]] + 1; }

    inline void pushdown(int o)
    {
        if (rev[o]) {
            rev[ch[o][0]] ^= 1; rev[ch[o][1]] ^= 1;
            rev[o] = 0; swap(ch[o][0], ch[o][1]);
        }
    }

    inline void rotate(int o)
    {
        register int f = fa[o], gf = fa[f], d = dir(o);
        fa[ch[f][d] = ch[o][d ^ 1]] = f;
        fa[o] = gf;
        if (!isrt(f)) ch[gf][dir(f)] = o;
        ch[fa[f] = o][d ^ 1] = f;
        maintain(f); maintain(o);
    }

    int top, stk[maxn];
    inline void splay(int o)
    {
        stk[top = 1] = o;
        for (register int t = o; !isrt(t); t = fa[t]) stk[++ top] = fa[t];
        while (top) pushdown(stk[top --]);
        for ( ; !isrt(o); rotate(o)) if (!isrt(fa[o])) rotate(dir(o) == dir(fa[o]) ? fa[o] : o);
    }

    inline void access(int o) { for (register int t = 0; o; t = o, o = fa[o]) splay(o), ch[o][1] = t, maintain(o); }

    inline void makeroot(int o) { access(o); splay(o); rev[o] ^= 1; }

    inline void link(int x, int y) { makeroot(x), fa[x] = y; }

    inline void cut(int x, int y) { makeroot(x); access(y); splay(y); ch[y][0] = 0; fa[x] = 0; }

}lct;

inline void Init()
{
    n = read();
    lct.sz[n + 1] = 1;
    For(i, 1, n) lct.sz[i] = 1, k[i] = read();
    For(i, 1, n) lct.link(i, judge(i + k[i]));
}

inline void Solve()
{
    for (register int m = read(); m --; ) {
        register int op = read(), x = read() + 1;
        if (op == 1) {
            lct.makeroot(x); lct.access(n + 1); lct.splay(x);
            printf("%d\n", lct.sz[x] - 1);
        } else {
            lct.cut(x, judge(x + k[x]));
            k[x] = read();
            lct.link(x, judge(x + k[x]));
        }
    }
}

int main()
{

    File();

    Init();

    Solve();

    return 0;
}
//醉别西楼醒不记。春梦秋云，聚散真容易。
//    -- 晏几道《蝶恋花·醉别西楼醒不记》