崆若的水题之--你绝对看不懂题干的并查集#2(转载自CHX的博客)

#include <cstdio> 
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#define REP(s, n) for(int i = s; i <= n; i ++)
#define RAP(s, n) for(int j = s; j <= n; j ++)
#define DE(i) e[POS(i)].del
#define POS(i) query[i].pos
#define V(i) query[i].v
#define ID(i) query[i].id
#define ANS(i) query[i].ans
#define COST(i) p[i].cost
#define HA(i) p[i].happy
using namespace std;
const int maxn = 20000 + 1;
const int maxm = 100000 + 1;
const int maxma = 200 + 1;
struct Point { int cost, happy; } p[maxn];
struct Edge { 
    int u, v, del; 
    Edge() { del = 0; }
}e[maxm];
struct Tedge { int to, next; } adj[maxm];
struct Questions {
    int pos, v, ans;
    bool id;
    Questions() { ans = 0; }
}query[maxm];
int Q, n, m, dp[maxn][maxma], f[maxn], tar_num[maxn], fch[maxn];
int findset(int x){
    return x == f[x] ? x : f[x] = findset(f[x]);
}
int ms = 1;
void AddEdge(int from, int to){
    adj[ms] = (Tedge) { to, fch[from] };
    fch[from] = ms ++;
    return ;
}
int que[maxn], tot;
void dfs(int x){
    que[++ tot] = x;
    for(int i = fch[x]; i; i = adj[i].next) dfs(adj[i].to);
    return ;
}
void merge(int u, int v){
    int f1 = findset(u), f2 = findset(v);
    if(f1 == f2) return ;
    if(tar_num[f1] > tar_num[f2]) swap(f1, f2);
    tar_num[f2] += tar_num[f1]; tar_num[f1] = 0; f[f1] = f2;
    tot = 0; dfs(f1); AddEdge(f2, f1);
    REP(1, tot){
        int v = p[que[i]].cost, w = p[que[i]].happy;
        for(int j = 200; j >= v; j --) dp[f2][j] = max(dp[f2][j], dp[f2][j - v] + w);
    }
    return ;
}
void read(int &x){
    x = 0; int sig = 1; char ch = getchar();
    while(!isdigit(ch)) { if(ch == ‘-‘) sig = -1; ch = getchar(); }
    while(isdigit(ch)) x = 10 * x + ch - ‘0‘, ch = getchar();
    x *= sig; return ;
}
void init()
{
    read(n), read(m), read(Q); int temp;
    REP(1, n) f[i] = i, tar_num[i] = 1;
    REP(1, n){
        read(COST(i)); read(HA(i));
        RAP(COST(i), 200) dp[i][j] = HA(i);
    }
    REP(1, m) read(e[i].u), read(e[i].v);
    REP(1, Q)
{
        read(temp); ID(i) = temp;
        if(!ID(i)) 
{
            read(POS(i));
            if(!DE(i)) DE(i) = i;
        }
        else read(POS(i)), read(V(i));
    }
    return ;
}
void work()
{
    REP(1, m) if(!e[i].del) merge(e[i].u, e[i].v);
    for(int i = Q; i; i --){
        if(!ID(i) && DE(i) == i) merge(e[POS(i)].u, e[POS(i)].v);
        else ANS(i) = dp[findset(POS(i))][V(i)];
    }
    return ;
}
void print()
{
    REP(1, Q) if(ID(i)) printf("%d\n", ANS(i));
    return ;
}
int main()
{
    init();
    work();
    print();
    return 0;
}