Arpa's weak amphitheater and Mehrdad's valuable Hoses CodeForces

   

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 w_i and some beauty b_i. 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 a₁, a₂, ..., a_k such that a_i and a_i + 1 are friends for each 1 ≤ i < k, and a₁ = x and a_k = 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 w₁, w₂, ..., w_n (1 ≤ w_i ≤ 1000) — the weights of the Hoses.

The third line contains n integers b₁, b₂, ..., b_n (1 ≤ b_i ≤ 10⁶) — the beauties of the Hoses.

The next m lines contain pairs of friends, the i-th of them contains two integers x_i and y_i (1 ≤ x_i, y_i ≤ n, x_i ≠ y_i), meaning that Hoses x_i and y_i are friends. Note that friendship is bidirectional. All pairs (x_i, y_i) 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.

Example

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.

1.并查集管理集合。

2.把集合看成一件物品，因为要么从集合中取一个元素，要么取整个集合，那么就对这个集合中的每件物品背一次，然后对这件物品背一次。最后背完所有的物品就是答案。。。

易懂的的代码：

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

const int INF=0x3f3f3f3f;
const int N=100010;

int dp[1010];
int fa[1010],c[1010],w[1010];

vector<int> vec[1010];

int Find(int x){
    if(x==fa[x]) return x;
    return fa[x]=Find(fa[x]);
}

int main()
{   int n,m,V;
    scanf("%d%d%d",&n,&m,&V);
    for(int i=1;i<=n;i++) scanf("%d",&c[i]);
    for(int i=1;i<=n;i++) scanf("%d",&w[i]);
    for(int i=1;i<=n;i++) fa[i]=i;
    for(int i=0;i<m;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        u=Find(u),v=Find(v);
        if(u!=v) fa[u]=v;
    }
    for(int i=1;i<=n;i++) vec[Find(i)].push_back(i);
    
    for(int i=1;i<=n;i++){
        if(fa[i]==i){
            for(int j=V;j>=0;j--){
                 int sumc=0,sumw=0;
                 for(int k=0;k<vec[i].size();k++){
                     sumc+=c[vec[i][k]];
                     sumw+=w[vec[i][k]];
                     if(j>=c[vec[i][k]]) dp[j]=max(dp[j],dp[j-c[vec[i][k]]]+w[vec[i][k]]);
                    }
                 if(j>=sumc) dp[j]=max(dp[j],dp[j-sumc]+sumw);
            }
        }
    }
    cout<<dp[V]<<endl;
    return 0;
}

 看不懂的代码：

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

const int INF=0x3f3f3f3f;
const int N=100010;

int dp[2][1010];
int fa[1010],b[1010],w[1010];

vector<int> vec[1010];

int Find(int x){
    if(x==fa[x]) return x;
    return fa[x]=Find(fa[x]);
}

int main()
{   int n,m,x;
    scanf("%d%d%d",&n,&m,&x);
    for(int i=1;i<=n;i++) scanf("%d",&w[i]);
    for(int i=1;i<=n;i++) scanf("%d",&b[i]);
    for(int i=1;i<=n;i++) fa[i]=i;
    for(int i=0;i<m;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        u=Find(u),v=Find(v);
        if(u!=v) fa[u]=v;
    }
    for(int i=1;i<=n;i++)
        vec[Find(i)].push_back(i);
    int now=0;
    for(int i=1;i<=n;i++){
        now=!now;
        int ww=0,bb=0;
        for(int j=0;j<=x;j++) dp[now][j]=dp[!now][j];
        for(int j=0;j<vec[i].size();j++){
            int id=vec[i][j];
            int www=w[id],bbb=b[id];
            ww+=www,bb+=bbb;
            for(int j=www;j<=x;j++)
               dp[now][j]=max(dp[now][j],dp[!now][j-www]+bbb); 
        }
        for(int j=ww;j<=x;j++)
            dp[now][j]=max(dp[now][j],dp[!now][j-ww]+bb);
    }
    int ans=0;
    for(int i=0;i<=x;i++) ans=max(ans,dp[now][i]);
    cout<<ans<<endl;
    return 0;
}