UVa 11795 Mega Man's Mission（动态规划-状态压缩DP）

B	Mega Man’s Missions
	Input	Standard Input
	Output	Standard Output

 

Mega Man is off to save the world again. His objective is to kill the Robots created by Dr. Wily whose motive is to conquer the world. In each mission, he will try to destroy a particular Robot. Initially, Mega Man is equipped with a weapon, called the “Mega Buster”which can be used to destroy the Robots.  Unfortunately, it may happen that his weapon is not capable of taking down every Robot. However, to his fortune, he is capable of using the weapons from Robots which he has completely destroyed and these weapons maybe able to take down Robots which he otherwise cannot with his own weapon. Note that, each of these enemy Robots carry exactly  one weapon themselves for fighting Mega Man.  He is able to take down the Robots in any order as long as he has at least one weapon capable of destroying the Robot at a particular mission. In this problem, given the information about the Robots and their weapons, you will have to determine the number of ways Mega Man can complete his objective of destroying all the Robots.

 

Input

Input starts with an integer T(T≤50), the number of test cases.

Each test case starts with an integer N(1≤N≤16). Here N denotes the number of Robots to be destroyed (each Robot is numbered from 1 to N). This line is followed by N+1 lines, each containing N characters. Each character will either be ‘1’ or ‘0’. These lines represent a (N+1)*N matrix. The rows are numbered from 0 to N while the columns are numbered from 1 to N. Row 0 represents the information about the “Mega Buster”. The j^th character of Row 0 will be ‘1’ if the “Mega Buster” can destroy the j^th Robot. For the remaining N rows, the j^th character of i^th row will be ‘1’ if the weapon of i^th Robot can destroy the j^th Robot. Note that, a Robot’s weapon could be used to destroy the Robot itself, but this will have no impact as the Robot must be destroyed anyway for its weapon to be acquired.

Output

For each case of input, there will be one line of output. It will first contain the case number followed by the number of ways Mega Man can complete his objective. Look at the sample output for exact format.

 

Sample Input	Sample Output
3 1 1 1 2 11 01 10 3 110 011 100 000	Case 1: 1 Case 2: 2 Case 3: 3

 

题目大意：

T组测试数据， 每组测试数据1个n，表示要杀n个人，接下来1行表示一开始，拥有杀哪些人的武器，例如“110”表示有杀第1，2个人的武器，接下来n行，分别表示杀完第i（1<=i<=n）个人可以得到的武器。

解题思路：

状态压缩DP，转移方程就是 dp[x] = sum(dp[y])，其中y满足两个条件，（1）y是x的子状态，也就是y再杀一个人k就到x。（2）y拥有杀k的武器。

参考代码：

#include <iostream>
using namespace std;

const int MAXN = 1 << 16;
int n, weapon[MAXN], temp[MAXN], nCase, cnt;
long long x, ans, dp[MAXN];

int ch2to10(long long x) {
    int t = 1, ans = 0;
    while (x) {
        ans += (x % 10) * t;
        x /= 10;
        t *= 2;
    }
    return ans;
}

void input() {
    cin >> n;
    cin >> x;
    weapon[0] = ch2to10(x);
    for (int i = 1; i <= n; i++) {
        cin >> x;
        temp[i] = ch2to10(x);
    }
}

long long DP(int x) {
    if (dp[x] != -1) return dp[x];
    dp[x] = 0;
    for (int i = 0; i < n; i++) {
        if (x & (1 << i)) {
            if (weapon[x - (1 << i)] & (1 << i)) {
                dp[x] += DP(x - (1 << i));
            }
        }
    }
    return dp[x];
}

void work() {
    dp[0] = 1;
    for (int i = 1; i < (1 << n); i++) {
        weapon[i] = weapon[0];
        dp[i] = -1;
        for (int j = n-1; j >= 0; j--) {
            if (i & (1 << j)) {
                weapon[i] |= temp[n-j];
            }
        }
    }
    ans = DP((1 << n) - 1);
}

void output() {
    cout << "Case " << ++cnt << ": " << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin >> nCase;
    while (nCase--) {
        input();
        work();
        output();
    }
    return 0;
}