Codeforces 741B Arpa's weak amphitheater and Mehrdad's valuable Hoses(并查集+分组背包)

Arpa's weak amphitheater and Mehrdad's valuable Hoses

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Just to remind, girls in Arpa's land are really nice.

Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight wi and some beauty bi. Also each Hos may have some friends. Hoses are divided in some friendship groups. Two Hoses x and y are in the same friendship group if and only if there is a sequence of Hoses a1, a2, ..., ak such that ai and ai + 1 are friends for each 1 ≤ i < k, and a1 = x and ak = y.

Arpa allowed to use the amphitheater of palace to Mehrdad for this party. Arpa's amphitheater can hold at most w weight on it.

Mehrdad is so greedy that he wants to invite some Hoses such that sum of their weights is not greater than w and sum of their beauties is as large as possible. Along with that, from each friendship group he can either invite all Hoses, or no more than one. Otherwise, some Hoses will be hurt. Find for Mehrdad the maximum possible total beauty of Hoses he can invite so that no one gets hurt and the total weight doesn't exceed w.

Input

The first line contains integers n, m and w (1  ≤  n  ≤  1000, , 1 ≤ w ≤ 1000) — the number of Hoses, the number of pair of friends and the maximum total weight of those who are invited.

The second line contains n integers w1, w2, ..., wn (1 ≤ wi ≤ 1000) — the weights of the Hoses.

The third line contains n integers b1, b2, ..., bn (1 ≤ bi ≤ 106) — the beauties of the Hoses.

The next m lines contain pairs of friends, the i-th of them contains two integers xi and yi (1 ≤ xi, yi ≤ n, xi ≠ yi), meaning that Hoses xi and yi are friends. Note that friendship is bidirectional. All pairs (xi, yi) are distinct.

Output

Print the maximum possible total beauty of Hoses Mehrdad can invite so that no one gets hurt and the total weight doesn't exceed w.

Examples

input

3 1 5
3 2 5
2 4 2
1 2

output

6

input

4 2 11
2 4 6 6
6 4 2 1
1 2
2 3

output

7

Note

In the first sample there are two friendship groups: Hoses {1, 2} and Hos {3}. The best way is to choose all of Hoses in the first group, sum of their weights is equal to 5 and sum of their beauty is 6.

In the second sample there are two friendship groups: Hoses {1, 2, 3} and Hos {4}. Mehrdad can't invite all the Hoses from the first group because their total weight is 12 > 11, thus the best way is to choose the first Hos from the first group and the only one from the second group. The total weight will be 8, and the total beauty will be 7.

题意：有n个人，每个人都有颜值bi与体重wi。剧场的容量为W。有m条关系，xi与yi表示xi和yi是好朋友，在一个小组。 每个小组要么全部参加舞会，要么参加人数不能超过1人。 问保证总重量不超过W，剧场中的颜值最大能到多少？

题解：分两步：  1.首先确定那些人在同一个小组，显然并查集做，然后把同一个根节点上的存在一个容器中。

   2. 按上面的要求对于每个容器中的人要么全部都取，要么只取一个，要么不取。 做01背包处理即 可。

代码如下：

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 1010;
int dp[maxn],b[maxn],w[maxn];
int tree[maxn];
vector<int>group[maxn];

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

void megre(int x,int y)
{
	int fx = find(x);
	int fy = find(y);
	if(fx!=fy)
		tree[fx] = fy;
}

int main()
{
	int n,W,m;
	while(scanf("%d%d%d",&n,&m,&W)!=EOF)
	{
		for(int i=1;i<=n;++i)
			scanf("%d\n",&w[i]);
		for(int i=1;i<=n;++i)
			scanf("%d\n",&b[i]);
		for(int i=1;i<=n;++i)
			tree[i]=i;
		while(m--)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			megre(x,y);
		}
		for(int i=0;i<maxn;++i)
			group[i].clear();
		for(int i=1;i<=n;++i){
			group[find(i)].push_back(i);
		}
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;++i)
		{
			if(find(i)!=i)
				continue;
			for(int j=W;j>=0;j--)
			{
				int sumw=0, sumb=0;
				for(int k=0;k<group[i].size();++k)
				{
					sumw+=w[group[i][k]];
					sumb+=b[group[i][k]];
					if(j>=w[group[i][k]])
						dp[j]=max(dp[j], dp[j-w[group[i][k]]] + b[group[i][k]]);
				}
				if(j>=sumw)
					dp[j]=max(dp[j],dp[j-sumw] + sumb);
			}
		}
		printf("%d\n",dp[W]);
	}
	return 0;
}