11795 - Mega Man's Mission(DP-状态DP)

最新推荐文章于 2018-04-13 17:25:55 发布

conquerheaven

最新推荐文章于 2018-04-13 17:25:55 发布

阅读量450

点赞数

分类专栏： DP-状态DP 文章标签： DP-状态DP

本文链接：https://blog.csdn.net/u011836218/article/details/38340169

版权

DP-状态DP 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

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^thRobot. 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

110

011

100

000

Case 1: 1

Case 2: 2

Case 3: 3

dp[2^16] 表示当前状态

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;

#define ll long long 
const int maxn = 1<<17;
ll dp[maxn] , N;
int KILL[20];

void initial(){
	for(int j = 0; j < maxn; j++) dp[j] = -1;
	for(int i = 0; i < 20; i++){
		KILL[i] = 0;
	}
}

void readcase(){
	scanf("%d" , &N);
	string str;
	for(int i = 0; i <= N; i++){
		cin >> str;
		int a = 1;
		for(int j = 0; j < str.length(); j++){
			if(str[j] == '1') KILL[i] += a;
			a = 2*a;
		}
	}
}

ll DP(int sta){
	if(sta+1 == (1<<N)) return 1;
	if(dp[sta] != -1) return dp[sta];
	ll ans = 0;
	int kill = KILL[0];
	for(int i = 0; i < N; i++){
		if((sta&(1<<i)) > 0) kill = (kill|KILL[i+1]);
	}
	for(int i = 0; i < N; i++){
		if((sta&(1<<i)) == 0 && (kill&(1<<i)) > 0) ans += DP((sta+(1<<i)));
	}
	return dp[sta] = ans;
}

void computing(){
	cout << DP(0) << endl;
}

int main(){
	int T;
	scanf("%d" ,&T);
	for(int i = 1; i <= T; i++){
		initial();
		readcase();
		printf("Case %d: " , i);
		computing();
	}
	return 0;
}