bzoj2102 [Usaco2010 Dec]The Trough Game
2014-09-19 22:13
148 查看
Description
Farmer John and Bessie are playing games again. This one has to do with troughs of water. Farmer John has hidden N (1 <= N <= 20) troughs behind the barn, and has filled some of them with food. Bessie has asked M (1 <= M <= 100) questions of the form, "Howmany troughs from this list (which she recites) are filled?". Bessie needs your help to deduce which troughs are actually filled. Consider an example with four troughs where Bessie has asked these questions (and received the indicated answers): 1) "How many
of these troughs are filled: trough 1" --> 1 trough is filled 2) "How many of these troughs are filled: troughs 2 and 3" --> 1 trough is filled 3) "How many of these troughs are filled: troughs 1 and 4" --> 1 trough is filled 4) "How many of these troughs
are filled: troughs 3 and 4" --> 1 trough is filled From question 1, we know trough 1 is filled. From question 3, we then know trough 4 is empty. From question 4, we then know that trough 3 is filled. From question 2, we then know that trough 2 is empty. 求N位二进制数X,使得给定的M个数,满足X
and Bi=Ci ,Bi ci分别是读入的两个数
Input
* Line 1: Two space-separated integers: N and M * Lines 2..M+1: A subset of troughs, specified as a sequence of contiguous N 0's and 1's, followed by a single integer that is the number of troughs in the specified subset that are filled.Output
* Line 1: A single line with: * The string "IMPOSSIBLE" if there is no possible set of filled troughs compatible with Farmer John's answers. * The string "NOT UNIQUE" if Bessie cannot determine from the given data exactly what troughs are filled. * Otherwise,a sequence of contiguous N 0's and 1's specifying which troughs are filled.
Sample Input
4 41000 1
0110 1
1001 1
0011 1
Sample Output
1010就是一很水的模拟啊……因为最多才2^20=100w所以直接暴力搞
#include<cstdio> int n,m; int a[110][30]; int x[110]; int ans=-1; inline bool mrk(int num) { for (int i=1;i<=m;i++) { int tot=0; for (int j=1;j<=n;j++) if ( a[i][j] && (num/(1<<(n-j)))%2 )tot++; if (tot!=x[i]) return 0; } return 1; } int main() { scanf("%d%d",&n,&m); for (int i=1;i<=m;i++) { for (int j=1;j<=n;j++) { char ch=getchar(); while (ch!='0'&&ch!='1')ch=getchar(); if(ch=='0')a[i][j]=0; else a[i][j]=1; } scanf("%d",&x[i]); } for (int i=0;i<(1<<n);i++) { if (mrk(i)) { if (ans!=-1){printf("NOT UNIQUE");return 0;} ans=i; } } if (ans!=-1)for (int j=n-1;j>=0;j--)printf("%d",(ans&(1<<j))/(1<<j)); else printf("IMPOSSIBLE"); return 0; }
相关文章推荐
- BZOJ2102 : [Usaco2010 Dec]The Trough Game
- bzoj2102 [Usaco2010 Dec]The Trough Game
- 【BZOJ】2102: [Usaco2010 Dec]The Trough Game(暴力)
- 2102: [Usaco2010 Dec]The Trough Game
- 【BZOJ1589】【USACO 2008 Dec Gold】 1.Trick or Treat on the Farm 基环树裸DP、
- BZOJ2091: [Poi2010]The Minima Game
- Bzoj1775 [Usaco2009 Dec]Vidgame 电视游戏问题
- BZOJ 1775 [Usaco2009 Dec] Vidgame 电视游戏问题
- 【POI2010】【BZOJ2091】The Minima Game
- bzoj 2091: [Poi2010]The Minima Game【博弈论+贪心+dp】
- 【BZOJ】2100: [Usaco2010 Dec]Apple Delivery(spfa+优化)
- BZOJ2097: [Usaco2010 Dec]Exercise 奶牛健美操
- 【bzoj2101】[Usaco2010 Dec]Treasure Chest 藏宝箱
- 【BZOJ1589】[Usaco2008 Dec]Trick or Treat on the Farm 采集糖果【SCC】【基环外向树】【DP】【记忆化搜索】
- bzoj 2100: [Usaco2010 Dec]Apple Delivery【spfa】
- poj3260[USACO2006,Dec]The Fewest Coins最少找零
- 2091: [Poi2010]The Minima Game
- bzoj2097 [Usaco2010 Dec]Exercise 奶牛健美操(二分答案+贪心+树)
- bzoj4395 [Usaco2015 dec]Switching on the Lights