CF 417D - Cunning Gena--状态压缩DP
2014-04-18 14:59
441 查看
A boy named Gena really wants to get to the "Russian Code Cup" finals, or at least get a t-shirt. But the offered problems are too complex, so he made an arrangement with his n friends
that they will solve the problems for him.
The participants are offered m problems on the contest. For each friend, Gena knows what problems he can solve. But Gena's friends won't agree to help Gena
for nothing: the i-th friend asks Gena xi rubles
for his help in solving all the problems he can. Also, the friend agreed to write a code for Gena only if Gena's computer is connected to at least ki monitors,
each monitor costs b rubles.
Gena is careful with money, so he wants to spend as little money as possible to solve all the problems. Help Gena, tell him how to spend the smallest possible amount of money. Initially, there's no monitors connected to Gena's computer.
Input
The first line contains three integers n, m and b (1 ≤ n ≤ 100; 1 ≤ m ≤ 20; 1 ≤ b ≤ 109) —
the number of Gena's friends, the number of problems and the cost of a single monitor.
The following 2n lines describe the friends. Lines number 2i and (2i + 1) contain
the information about the i-th friend. The 2i-th
line contains three integers xi, ki and mi (1 ≤ xi ≤ 109; 1 ≤ ki ≤ 109; 1 ≤ mi ≤ m) —
the desired amount of money, monitors and the number of problems the friend can solve. The (2i + 1)-th line contains mi distinct
positive integers — the numbers of problems that thei-th friend can solve. The problems are numbered from 1 to m.
Output
Print the minimum amount of money Gena needs to spend to solve all the problems. Or print -1, if this cannot be achieved.
Sample test(s)
input
output
input
output
input
output
that they will solve the problems for him.
The participants are offered m problems on the contest. For each friend, Gena knows what problems he can solve. But Gena's friends won't agree to help Gena
for nothing: the i-th friend asks Gena xi rubles
for his help in solving all the problems he can. Also, the friend agreed to write a code for Gena only if Gena's computer is connected to at least ki monitors,
each monitor costs b rubles.
Gena is careful with money, so he wants to spend as little money as possible to solve all the problems. Help Gena, tell him how to spend the smallest possible amount of money. Initially, there's no monitors connected to Gena's computer.
Input
The first line contains three integers n, m and b (1 ≤ n ≤ 100; 1 ≤ m ≤ 20; 1 ≤ b ≤ 109) —
the number of Gena's friends, the number of problems and the cost of a single monitor.
The following 2n lines describe the friends. Lines number 2i and (2i + 1) contain
the information about the i-th friend. The 2i-th
line contains three integers xi, ki and mi (1 ≤ xi ≤ 109; 1 ≤ ki ≤ 109; 1 ≤ mi ≤ m) —
the desired amount of money, monitors and the number of problems the friend can solve. The (2i + 1)-th line contains mi distinct
positive integers — the numbers of problems that thei-th friend can solve. The problems are numbered from 1 to m.
Output
Print the minimum amount of money Gena needs to spend to solve all the problems. Or print -1, if this cannot be achieved.
Sample test(s)
input
2 2 1 100 1 1 2 100 2 1 1
output
202
input
3 2 5 100 1 1 1 100 1 1 2 200 1 2 1 2
output
205
input
1 2 1 1 1 1 1
output
-1
思路:将朋友按照K从小到大排序后状态压缩DP。
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; #define inf 0x3f3f3f3f3f3f3f3fll #define maxn (1<<20) #define LL long long int #define min(a,b) a>b?b:a; LL dp[maxn]; struct Friend { LL cos,k,sve; bool operator < (const Friend & a)const { return k < a.k; } }fri[108]; int main() { //freopen("in.txt","r",stdin); LL n,m,b; while(scanf("%I64d%I64d%I64d",&n,&m,&b)==3) { for(int i = 1;i <= n;i++) { LL x,k,num; scanf("%I64d%I64d%I64d",&x,&k,&num); int sve = 0,key; for(int j = 1;j <= num;j++) { scanf("%d",&key); sve |= (1<<(key-1)); } fri[i].cos = x; fri[i].k = k; fri[i].sve = sve; } sort(fri+1,fri+1+n); memset(dp,0x3f,sizeof(dp)); dp[0] = 0; LL ans = inf; int all = (1<<m); int pos = 1; for(int i = 1;i <= n;i++) { for(int j = 0;j < all;j++) { dp[j|fri[i].sve] = min(dp[j|fri[i].sve],dp[j]+fri[i].cos); } if(dp[all-1] != inf && (dp[all-1] + fri[i].k*b < ans)) { ans = dp[all-1] + fri[i].k*b; pos = i; } } if(ans >= inf) ans = -1; printf("%I64d\n",ans); } return 0; }
相关文章推荐
- CF 453B状态压缩dp
- CF - 580D. Kefa and Dishes - 状态压缩DP
- CF 327E(Axis Walking-状态压缩Dp-lowbit的使用)
- CF 259div2 D (状态压缩dp)
- CF 327E(Axis Walking-状态压缩Dp-lowbit的使用)
- CF 453B Little Pony and Harmony Chest 解题报告(状态压缩DP)
- CF417D——Cunning Gena(状态压缩DP)
- CF 141 Div2 C Fractal Detector(状态压缩DP)
- [CF 417D]Cunning Gena:状压DP
- POJ 2923 Relocation(状态压缩DP+DP:01背包)
- POJ 3254 Corn Fields 状态压缩dp
- poj 1038 Bugs Integrated, Inc. 状态压缩dp
- hdu 1565 状态压缩dp
- POJ 1321 棋盘问题 DFS 和 状态压缩DP
- ACM HDU 1074 Doing Homework(位运算,搜索,状态压缩DP)
- HDU 4085 Peach Blossom Spring 斯坦纳树 状态压缩DP+SPFA
- hdu 5418 (状态压缩DP)
- poj 1185 状态压缩dp
- POJ2686 状态压缩dp
- 【HDU3681】Prison Break-状态压缩DP+BFS+二分答案