CF 417D - Cunning Gena--状态压缩DP
来源:互联网 发布:arduino和单片机 编辑:程序博客网 时间:2024/04/30 11:38
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.
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.
Print the minimum amount of money Gena needs to spend to solve all the problems. Or print -1, if this cannot be achieved.
2 2 1100 1 12100 2 11
202
3 2 5100 1 11100 1 12200 1 21 2
205
1 2 11 1 11
-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 417D - Cunning Gena--状态压缩DP
- Codeforces 417D Cunning Gena(状态压缩dp)
- [CF 417D]Cunning Gena:状压DP
- CF 417D Cunning Gena [状压dp+排序]
- codefoces 417D Cunning Gena 状压DP
- CodeForces 417D Cunning Gena 状压dp
- COdeforces#417D Cunning Gena(状压DP)
- CF417D——Cunning Gena(状态压缩DP)
- Codeforces 417 D. Cunning Gena
- 【CodeForces 417D】【Cunning Gena】
- codeforces 417D Cunning Gena
- Codeforces 417D Cunning Gena【排序+状压dp】
- codeforces 418B. Cunning Gena (状态dp)
- CF RCC 2014 Warmup (Div. 2) D. Cunning Gena
- CF RCC 2014 Warmup (Div. 2) D. Cunning Gena
- RCC 2014 Warmup (Div. 2) D. Cunning Gena(状压DP)
- CF417DCunning Gena【状态压缩DP】
- CF Round 235 D 状态压缩 dp
- ios推送
- base64解码和编码范例(iPhone和Mac通用)
- 浅谈PE文件结构和进程内存空间结构(2)
- spring详解
- 致新手:学习SEO是否有用?
- CF 417D - Cunning Gena--状态压缩DP
- 第7周作业3-均值计算
- 大数问题
- Android学习笔记之AndroidManifest.xml文件解析
- Android Intent 程序之间进行通信 传输数据
- 几句代码写出一个内容轮播器(jQuery插件的神奇)jQuery.flexslider.js登场!!
- 【Gapps】安装GooglePlay引发一系列问题
- UINavigationController中是否显示返回按钮
- 【WINDOWS】Locale ID (LCID) Chart