POJ：3185-The Water Bowls（枚举反转）

The Water Bowls

Time Limit: 1000MS Memory Limit: 65536K

Total Submissions: 7402 Accepted: 2927

Description

The cows have a line of 20 water bowls from which they drink. The bowls can be either right-side-up (properly oriented to serve refreshing cool water) or upside-down (a position which holds no water). They want all 20 water bowls to be right-side-up and thus use their wide snouts to flip bowls.

Their snouts, though, are so wide that they flip not only one bowl but also the bowls on either side of that bowl (a total of three or – in the case of either end bowl – two bowls).

Given the initial state of the bowls (1=undrinkable, 0=drinkable – it even looks like a bowl), what is the minimum number of bowl flips necessary to turn all the bowls right-side-up?

Input

Line 1: A single line with 20 space-separated integers

Output

Line 1: The minimum number of bowl flips necessary to flip all the bowls right-side-up (i.e., to 0). For the inputs given, it will always be possible to find some combination of flips that will manipulate the bowls to 20 0’s.

Sample Input

0 0 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0

Sample Output

Hint

Explanation of the sample:

Flip bowls 4, 9, and 11 to make them all drinkable:

0 0 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 [initial state]

0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 [after flipping bowl 4]

0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 [after flipping bowl 9]

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 [after flipping bowl 11]

解题心得：

有一行的碗，有的碗朝上有的碗朝下（１为上，０为下）。每次可以反转一只碗，如果反转一只碗，那么和这个碗相邻的碗也会反转，问最少反转多少次让所有的碗朝下。
想了很多种方法，最后还是枚举，总共二十只碗，有2^20次方中可能性，勉强可以接受。然后在枚举的过程中可以剪一下枝。

#include <algorithm>

#include <stdio.h>

#include <cstring>

#include <climits>

using namespace std;

const int maxn = 25;

int num[maxn];

int get(int x) {//较快的获得ｘ的二进制中有多少个１

    int cnt = 0;

    while(x) {

        x &= (x-1);

        cnt++;

    }

    return cnt;

}

bool check(int x) {//检查是否完全反转向下

    int num2[maxn];

    memcpy(num2,num,sizeof(num));

    for(int i=0;i<20;i++) {

        if(1&(x>>i)) {

            num2[i]++;

            if(i-1>=0)

                num2[i-1]++;

            num2[i+1]++;

        }

    }

    for(int i=0;i<20;i++) {

        if(num2[i]%2)

            return true;

    }

    return false;

}

int main() {

    for(int i=0;i<20;i++)

        scanf("%d",&num[i]);

    int ans = INT_MAX;

    for(int i=0;i<(1<<20);i++) {

        int num_1 = get(i);

        if(num_1 > ans)//如果现在枚举的数二进制中１的个数比当前答案还多可以直接剪去

            continue;

        if(check(i))

            continue;

        else

            ans = min(ans,get(i));

    }

    printf("%d\n",ans);

    return 0;

}

巴特西