POJ 2436 USACO silver
来源:互联网 发布:淘宝bug刷话费 编辑:程序博客网 时间:2024/05/17 06:37
题意:
总共最多有15种疾病
有n头牛,每头牛有di种疾病,分别用1-15之间的数字来表示
要求选择最多头牛 使他们的疾病种数不超过K
思路:
枚举状态,状态是当前有哪几种病,然后判断每头牛是否能选择即可
code:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 40000;int cow[1005];int tab[maxn];int n,D,k;void table(){ for(int s = 0; s < (1<<15); s++){ int cnt = 0; int tmp = s; while(tmp){ if(tmp&1) cnt++; tmp = tmp>>1; } tab[s] = cnt; }}void init(){ int di; memset(cow, 0, sizeof(cow)); for(int i = 0; i < n; i++){ scanf("%d",&di); int s = 0,tmp; while(di--){ scanf("%d",&tmp); s |= (1<<(tmp-1)); } cow[i] = s; }}void solve(){ int ans = 0; for(int s = 0; s < (1<<D); s++){ if(tab[s] > k) continue; int cnt = 0; for(int i = 0; i < n; i++){ if(s == (s|cow[i])) cnt++; } ans = max(ans, cnt); } printf("%d\n",ans);}int main(){ table(); while(scanf("%d%d%d",&n,&D,&k) != EOF){ init(); solve(); } return 0;}
0 0
- POJ 2436 USACO silver
- 【poj 3268】 Silver Cow Party 【USACO 2007 February Silver】
- poj 3279 Filptile (USACO 2007 Open Silver)
- POJ - 3258/USACO - Dec06 Silver/NOIP 2015 - 提高组 River Hopscotch 贪心+二分搜索
- USACO 2010 FEB Silver题解
- USACO 2014 February Contest, Silver
- [USACO 2014 Jan Silver]ccski
- [USACO 2014 Feb Silver]scode
- [USACO 2014 Mar Silver]irrigation
- [USACO 2014 Mar Silver]mooomoo
- USACO 2017 February Contest Silver
- poj Silver Cow Party
- poj Silver Cow Party
- Silver Cow Party POJ
- Silver Cow Party POJ
- Silver Cow Party POJ
- Silver Cow Party POJ
- POJ Silver Cow Party
- Splash screen
- 使用SurfaceView和MedioPlayer播放视频
- ios取景器
- int、long、long long取值范围
- qt中定时器的使用
- POJ 2436 USACO silver
- 第六届蓝桥杯JavaA组 第八题 移动距离
- PostgreSQL 常用数据类型
- 【机器学习】(4):监督式学习
- 指令集简介
- 海量数据处理算法—Bloom Filter
- cocos2d-x (四):触摸事件处理机制
- CSS3的[att*=val]选择器
- 【概念对比】编程语言之强类型与弱类型