Corn Fields POJ - 3254 (状压dp)

Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, some of the squares are infertile and can't be planted. Canny FJ knows that the cows dislike eating close to each other, so when choosing which squares to plant, he avoids choosing squares that are adjacent; no two chosen squares share an edge. He has not yet made the final choice as to which squares to plant.

Being a very open-minded man, Farmer John wants to consider all possible options for how to choose the squares for planting. He is so open-minded that he considers choosing no squares as a valid option! Please help Farmer John determine the number of ways he can choose the squares to plant.

Input

Line 1: Two space-separated integers: M and N 
Lines 2.. M+1: Line i+1 describes row i of the pasture with N space-separated integers indicating whether a square is fertile (1 for fertile, 0 for infertile)

Output

Line 1: One integer: the number of ways that FJ can choose the squares modulo 100,000,000.

 

状压dp入门题，详解看代码

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <queue>
using namespace std;

const int MAX = 1e5 + 50;
int MOD = 100000000;
int INF = 1e9;
int top = 0; 
int state[MAX]; //存所有不相邻的情况
int mmap[MAX]; //存图
int dp[20][MAX];

bool isadj(int x){ //判断是否有相邻
	if(x & (x << 1)){ 
		return 1;
	} else{
		return 0;
	}
}

bool isok(int i, int j){
	if(state[i] & mmap[j]){ //判断是否占用了不可占用的区域
		return 0;
	} else{
		return 1;
	}
}
int main() {
	int n, m;
	scanf("%d%d", &n, &m);

	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			int x;
			scanf("%d", &x);
			if(x == 0){
				mmap[i] += (1 << (m - j)); //方便判断是否合法
			}
		}
	}

	for(int i = 0; i < (1 << m); i++){ // 注意这里是小于不是小于等于
		if(!isadj(i)){
			state[++top] = i; //获得所有可行状态
		}
	}

	for(int i = 1; i <= top; i++){
		if(isok(i, 1)){
			dp[1][i] = 1; // 若可行则标记为1
		}
	}

	for(int r = 2; r <= n; r++){ //从第二行开始
		for(int i = 1; i <= top; i++){
			if(isok(i, r)){ //判断是否占用了不可占用的区域
				for(int j = 1; j <= top; j++){
					if(isok(j, r - 1) && !(state[i] & state[j])){ //判断是否占用了不可占用的区域，以及两行是否相邻
						dp[r][i] = (dp[r - 1][j] + dp[r][i]) % MOD;
					}
				}
			}
		}
	}

	int ans = 0;
	for(int i = 1; i <= top; i++){
		ans = (ans + dp[n][i]) % MOD;
	}

	printf("%d\n", ans);
	return 0;
}