AcWing 1252. 搭配购买--并查集+01背包

AcWing 1252. 搭配购买

#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
template<class...Args>
void debug(Args... args) {//Parameter pack
    auto tmp = { (cout << args << ' ', 0)... };
    cout << "\n";
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 1e6 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 0x7fffffff;

int father[N];
int val[N], cost[N];
void init_set() {
    for (int i = 1; i <= N; i++) {
        father[i] = i;
    }
}
int find_set(int x) {
    if (x != father[x]) {
        int root = find_set(father[x]);
        father[x] = root;
    }
    return father[x];
}
bool comp(pii x, pii y) {
    if (x.first == y.first) {
        return x.second > y.second;
    }
    return x.first > y.first;
}
int vis[N];
int dp[N];
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    int n, m, w;
    cin >> n >> m >> w;
    init_set();
    for (int i = 1; i <= n; i++) cin >> cost[i] >> val[i];
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u = find_set(u);
        v = find_set(v);
        if (u != v) {//u和v不在一个集合内
            father[u] = v;
            cost[v] += cost[u];
            val[v] += val[u];
        }
    }
    vector<pii> vv;
    for (int i = 1; i <= n; i++) {
        int t = find_set(i);
        if (!vis[t]){
            vv.push_back({ val[t],cost[t] });
            vis[t] = 1;
        }
    }
    sort(vv.begin(), vv.end(), comp);
    for (int i = 0; i < vv.size(); i++) {
        int cost = vv[i].second;
        int val = vv[i].first;
        for (int j = w; j >= cost; j--) {
            dp[j] = max(dp[j], dp[j - cost]+ val);
        }
    }
    cout << dp[w] << "\n";

    return 0;
}