CodeForces 1423H Virus

• 题目链接：https://codeforces.com/problemset/problem/1423/H
• 这个题目，显而易见的需要可撤销并查集，然后发现，每条边有一个存在时间，我们只需要处理出这个存在时间，那么这个题目就可以使用线段树分治+可撤销并查集来维护。当然这个地方的时间与操作数量对等，而不是天数，如果是天数的话，处理询问会存在很大的麻烦，读者可以自己思考一下，但是如果这里以操作顺序为时间轴，那么就会简单很多，不会存在加边和查询的先后问题

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
#define sz(a) (int)a.size()
#define pii pair <int,int>
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

const int N = 6e5 + 5;
int n , Q , k, pp;
vector <int> v[N << 2];
int ans[N];
struct node {
    int op, x, y;
}in[N];
vector <int> three;
struct Undo_Dsu
{
    stack <pii> st ;
    int fa[N] , siz[N] ;
    void init()
    {
        while(!st.empty())  st.pop() ;
        for (int i = 1 ; i <= N - 5 ; i ++)  fa[i] = i , siz[i] = 1 ;
    }
    int findroot(int x)
    {
        return x == fa[x] ? x : findroot(fa[x]) ;
    }
    bool merge(int u , int v)
    {
        int fax = findroot(u) , fay = findroot(v);
        if(fax == fay)  return 0 ;
        if (siz[fax] > siz[fay])  swap(fax, fay) , swap(u , v) ;
        fa[fax] = fay , siz[fay] += siz[fax] ;
        st.push({fax , fay}) ;
        return 1 ;
    }
    void undo()
    {
        pii no = st.top();
        fa[no.fi] = no.fi ;
        siz[no.se] -= siz[no.fi] ;
        st.pop() ;
    }
} dsu ;
void insert (int i , int L , int R, int l , int r , int val)
{
    if (L > r || R < l) return ;
    if (l <= L && R <= r) {
        v[i].pb(val);
        return ;
    }
    int mid = (L + R) >> 1;
    insert (i << 1 , L , mid , l , r , val);
    insert (i << 1 | 1 , mid + 1 , R , l , r, val);
}
void dfs (int i , int L, int R)
{
    int t = sz(dsu.st);
    for (auto it : v[i])
    {
        if (in[it].op == 1)
        {
            int u = in[it].x, vv = in[it].y;
            dsu.merge(u, vv);
        }
    }
    for (auto it : v[i])
    {
        if (in[it].op == 2){
            ans[it] = dsu.siz[dsu.findroot(in[it].x)];
        }
    }
    if (L == R)
    {
        while (sz(dsu.st) > t)
            dsu.undo();
        return ;
    }
    int mid = (L + R) >> 1;
    dfs (i << 1 , L , mid);
    dfs (i << 1 | 1, mid + 1 , R);
    while (sz(dsu.st) > t) dsu.undo();
    return ;
}
int main ()
{
    mem (ans, -1);
    three.pb(0);
    read (n,  Q, k);
    for (int i = 1 ; i <= Q ; i ++)
    {
        read (in[i].op);
        if (in[i].op == 1)
            read (in[i].x,in[i].y);
        if (in[i].op == 2) {
            read(in[i].x);
            insert (1, 1, Q, i , i, i);
        }
        if (in[i].op == 3)
            three.pb(i), pp ++;
    }
    three.pb(Q + 1);
    int sz = sz(three);
    for (int i = 1 ; i < three.size(); i++)
    {
        for (int l = three[i - 1]; l <= three[i]; l++)
        {
            if (in[l].op == 1)
            {
                int r = Q;
                if (i + k - 1 < sz) r= three[i+k-1];
                insert(1, 1, Q, l, r, l);
            }
        }
    }

    dsu.init();
    dfs (1, 1 , Q);
    for (int i = 1 ; i <= Q ; i ++)
        if (in[i].op == 2)
            write (ans[i]), LF;



}