搭配购买--依赖背包

Luogu 1455

题目分析：

• 用并查集处理出在一起的物品并合并，再$01$背包

Code：

#include <bits/stdc++.h>
using namespace std;
#define maxn 10010
#define maxv 10010

int n,m,dp[maxv],f[maxn],v,c[maxn],w[maxn];

inline void init_() {
	freopen("a.txt","r",stdin);
}

inline int read_() {
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9') {
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9') {
		x=(x<<1)+(x<<3)+c-'0';
		c=getchar();
	}
	return x*f;
}

int find_(int x) {
	if(f[x]==x) return x;
	return f[x]=find_(f[x]);
}

void readda_() {
	n=read_();m=read_();v=read_();
	for(int i=1;i<=n;++i) {
		c[i]=read_();w[i]=read_();
		f[i]=i;	
	}
	int x,y,fx,fy;
	for(int i=1;i<=m;++i) {
		x=read_();y=read_();
		fx=find_(x);fy=find_(y);
		if(fx!=fy) f[fx]=fy;
	}
	for(int i=1;i<=n;++i) {
		fx=find_(i);
		if(fx!=i) {
			c[fx]+=c[i];
			w[fx]+=w[i];
			c[i]=0;
			w[i]=0;
		}
	} 
	memset(dp,0,sizeof(dp));
	for(int i=1;i<=n;++i) {
		for(int j=v;j>=c[i];--j) {
			dp[j]=max(dp[j],dp[j-c[i]]+w[i]);
		}
	} 
	printf("%d",dp[v]);
}

int main() {
	init_();
	readda_();
	return 0;
}