[USACO 2010 Dec S]The Trough Game

题目描述：
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, ‘How many 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.

输入描述:

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

输出描述:

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

输入

4 4
1000 1
0110 1
1001 1
0011 1

输出

1010

#include <iostream>
#include <cstring>
using namespace std;
int A[105][25];
int B[105];
int N,M,result=-1;
bool judge(int n){
    for(int i=0;i<M;i++){
        int tot=0;
        for(int j=0;j<N;j++)if(((n>>j)&1)&&A[i][j])tot++;
        if(tot!=B[i])return false;
    }
    return true;
}
int main()
{
    cin>>N>>M;
    string s;
    for(int i=0;i<M;i++){
        cin>>s>>B[i];
        for(int j=0;j<N;j++)A[i][j]=s[j]-'0';
    }
    int size=(1<<N);
    for(int i=0;i<size;i++){
        if(judge(i)){
            if(result!=-1){cout<<"NOT UNIQUE"<<endl;return 0;}
            result=i;
        }
    }
    if(result!=-1)for(int i=0;i<N;i++)cout<<((result>>i)&1);
    else cout<<"IMPOSSIBLE"<<endl;
    return 0;
}

对本题进行分析时，我们最能想到的就是枚举，把所有情况进行比对然后就能找到结果。但是如果不会位运算的小伙伴可能枚举就有些困难了。

因为枚举用0，1 所以本题主要是运用到位运算的知识（所以我在下面讲解一下我的代码用到的小知识 如果不清楚的可以看看 我也就当自己复习了）
1.首先我们清楚机器存储数据时使用0，1存储，所以一个int类型其实有32位0，1来存储的。
2.当用 x<<2 将x左移2位也是将x乘以2² 同理右移就是除

本题关键
1.枚举 当n=4时 范围其实就是0000-1111而int范围就是0-15 即((1<<4)-1)
2.取出int类型中的01 ((result>>i)&1)的意思其实就是取出result中第i位
（因为1是（0001）最后一位是1 如果其它最后一位是1就是1 是0就是0）