【AcWing】1252. 搭配购买

题目链接

思路：并查集 + 01背包

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 1e4 + 10;

int n, m, w;
int p[maxn], c[maxn], d[maxn], dp[maxn];

int find(int x)
{
    if(p[x] != x) return p[x] = find(p[x]);
    return p[x];
}

int main()
{
    scanf("%d%d%d", &n, &m, &w);
    for(int i = 1;i <= n; i++) p[i] = i;
    for(int i = 1;i <= n; i++) scanf("%d%d", &c[i], &d[i]);
    while(m--)
    {
        int u, v;
        scanf("%d%d", &u, &v);
        int a = find(u), b = find(v);
        if(a != b)
        {
            c[b] += c[a];
            d[b] += d[a];
            p[a] = b;
        }
    }
    for(int i = 1;i <= n; i++)
    {
        if(p[i] == i)
        {
            for(int j = w;j >= c[i];j--)
            {
                dp[j] = max(dp[j], dp[j - c[i]] + d[i]);
            }
        }
    }
    printf("%d\n", dp[w]);
    return 0;
}