【Codeforces 741 B. Arpa's weak amphitheater and Mehrdad's 】+ 并查集 + 01背包

B. 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

Input

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

Output

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.

有关系的并查集分在一组~01背包~每组选一个或全选~更新最优解即可~~

AC代码：

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
struct node{int x,y;
}st[1010];
int t[1010],dp[1010];
vector <int> v[1010];
int find(int x){while(x != t[x])x = t[x];return x;
}
int main()
{int N,M,W,a,b;scanf("%d %d %d",&N,&M,&W);for(int i = 1 ; i <= N; i++)scanf("%d",&st[i].x);for(int i = 1 ; i <= N; i++){scanf("%d",&st[i].y);t[i] = i;}while(M--){scanf("%d %d",&a,&b);int fa = find(a),fb = find(b);if(fa != fb)t[fa] = fb;}for(int i = 1 ; i <= N; i++)v[find(i)].push_back(i); // 建组for(int i = 1 ; i <= N; i++)if(find(i) == i){ // 一个组遍历一次for(int u = W; u >= 1 ; u--){int fw = 0,fb = 0;for(int j = 0 ; j < v[i].size(); j++){fw += st[v[i][j]].x;fb += st[v[i][j]].y;if(u >= st[v[i][j]].x)dp[u] = max(dp[u],dp[u - st[v[i][j]].x] + st[v[i][j]].y);}if(u >= fw)dp[u] = max(dp[u],dp[u - fw] + fb);}}printf("%d\n",dp[W]);return 0;
}

【Codeforces 741 B. Arpa's weak amphitheater and Mehrdad's 】+ 并查集 + 01背包相关推荐

Codeforces Round #383 (Div. 2) D. Arpa's weak amphitheater and Mehrdad's valuable Hoses —— DP（01背包）
题目链接:http://codeforces.com/contest/742/problem/D D. Arpa's weak amphitheater and Mehrdad's valuable ...
Codeforces 741 D - Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths
D - Arpa's letter-marked tree and Mehrdad's Dokhtar-kosh paths 思路: 树上启发式合并从根节点出发到每个位置的每个字符的奇偶性记为每个位 ...
Codeforces 742B B. Arpa’s obvious problem and Mehrdad’s terrible solution
B. Arpa's obvious problem and Mehrdad's terrible solution time limit per test 1 second memory limit ...
Codeforces Round #548 (Div. 2) C. Edgy Trees（dfs || 并查集)
题目链接:https://codeforces.com/contest/1139/problem/C 题意:给了一棵树,n个点,m条边.让从中选k个点,使得从a1到a2,a2到a3,ak-1到ak的路 ...
【CodeForces】741 D. Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths（dsu on tree)
[题意]给定n个点的树,每条边有一个小写字母a~v,求每棵子树内的最长回文路径,回文路径定义为路径上所有字母存在一种排列为回文串.n<=5*10^5. [算法]dsu on tree [题解]这 ...
【codeforces 742A】Arpa’s hard exam and Mehrdad’s naive cheat
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
Codeforces 742 C Arpa's loud Owf and Mehrdad's evil plan
题目地址:http://codeforces.com/contest/742/problem/C 题意:我看了好多别人的博客的对于题意的理解,结合他们的代码我认为这道题的意思应该是每个数要都能经过t步 ...
CF - 741(C. Arpa’s overnight party and Mehrdad’s silent entering) 二分图构造
题目链接题意已经给出情侣的座位编号,将两种饭分配给N对情侣.满足以下两个要求: 情侣之间不能吃相同的饭座位号连续的三个人不能吃同一种饭问是否存在满足的解. 思路构造二分图对应情侣的座位建边 ...
【CodeForces - 371D】Vessels（思维，元素合并，并查集）
题干: There is a system of n vessels arranged one above the other as shown in the figure below. Assume ...

【Codeforces 741 B. Arpa's weak amphitheater and Mehrdad's 】+ 并查集 + 01背包

【Codeforces 741 B. Arpa's weak amphitheater and Mehrdad's 】+ 并查集 + 01背包相关推荐

最新文章

热门文章