poj 3254 Corn Fields (状压dp)
来源:互联网 发布:jk js 编辑:程序博客网 时间:2024/06/05 17:23
Description
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
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
Sample Input
2 31 1 10 1 0
Sample Output
9
Hint
1 2 3 4
There are four ways to plant only on one squares (1, 2, 3, or 4), three ways to plant on two squares (13, 14, or 34), 1 way to plant on three squares (134), and one way to plant on no squares. 4+3+1+1=9.
Source
#include<stdio.h>#include<string.h>#define mem(a) memset(a,0,sizeof(a))#define Mod 1000000000using namespace std;int mp[1<<12];int st[1<<12];int dp[20][1<<12];int judge(int x,int y){ if(x&y) return 0; return 1;}int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { mem(dp); mem(mp); mem(st); int x; for(int i=1; i<=n; i++) { for(int j=1; j<=m; j++) { scanf("%d",&x); ///状压很少敲,,,入门都想了好久,,mp不能种植的地方存为1 能种植的地方存为0 x=!x; mp[i]=((mp[i]<<1)|x); } } int k=0; for(int i=0; i<(1<<m); i++) { if(judge(i,i<<1)) { st[++k]=i; } } // printf("%d\n",k); int tmp=0; for(int i=1; i<=k; i++) { if(judge(mp[1],st[i])) { tmp++; dp[1][i]=1; } } //printf("t: %d %d\n",tmp,mp[1]); for(int i=2; i<=n; i++) { for(int j=1; j<=k; j++) { if(judge(mp[i],st[j])) { for(int l=1; l<=k; l++) { if(judge(mp[i-1],st[l])&&judge(st[j],st[l])) dp[i][j]+=dp[i-1][l]; } } } } int res=0; for(int i=1; i<=k; i++) { res+=dp[n][i]; res%=Mod; } printf("%d\n",res); }}
- POJ 3254 Corn Fields(状压dp)
- [poj 3254]Corn Fields[状压DP]
- poj 3254 Corn Fields 状压dp
- POJ 3254 Corn Fields 【状压DP】
- Corn Fields - POJ 3254 状压dp
- POJ 3254 Corn Fields 状压DP
- POJ 3254 Corn Fields(状压dp)
- POJ 3254-Corn Fields(状压DP)
- poj 3254 Corn Fields(状压dp)
- POJ 3254 - Corn Fields [状压DP]
- POJ 3254 Corn Fields (状压DP)
- poj 3254 Corn Fields 状压dp入门
- poj 3254 Corn Fields 【状压 DP 入门】
- 【状压dp】poj 3254 Corn Fields
- poj 3254 Corn Fields (状压DP)
- POJ 3254 Corn Fields (状压dp)
- 【POJ 3254】 Corn Fields(状压DP)
- POJ 3254 Corn Fields (状压DP)
- POJ 2104 K-th Number 静态第K大模板
- Codeforces Round #433(Div.2) C,D,E题目详解
- HDU 4325 Flowers(树状数组+离散化)
- java SE类初始化过程学习记录
- oracle学习之oracle基础
- poj 3254 Corn Fields (状压dp)
- Codeforces Round #433 (Div. 2) 题解
- Android WebView 中的 Html 网页定位操作
- 暴力枚举 循环数
- MySQL分区
- java虚拟机学习笔记一
- RxJava2 源码分析(一)
- EBS采购订单创建发票
- 今日所习