POJ3254 Corn Fields(DP)
来源:互联网 发布:python爬虫克隆网页 编辑:程序博客网 时间:2024/06/05 15:15
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 <iostream>#include <algorithm>using namespace std;int a[15];int dp[2][400];int state[400];const int MOD=100000000;int cnt;void init(){ cnt=0; for(int i=0;i<(1<<12);i++) if((i&(i<<1))==0 && (i&(i>>1))==0) state[cnt++]=i;}int main(){// freopen("in.txt","r",stdin);// freopen("out.txt","w",stdout); init(); int n,m; int t; while(scanf("%d%d",&n,&m)==2) { for(int i=0;i<n;i++) { a[i]=0; for(int j=0;j<m;j++) { a[i]<<=1; scanf("%d",&t); t=1-t; a[i]|=t; } } memset(dp,0,sizeof(dp)); int now=0; dp[now][0]=1; int tot=(1<<m); for(int i=0;i<n;i++) { for(int j=0;j<cnt&&state[j]<tot;j++) if(dp[now][j]) { for(int k=0;k<cnt&&state[k]<tot;k++) { if(state[k]&a[i])continue; if(state[k]&state[j])continue; dp[now^1][k]+=dp[now][j]; dp[now^1][k]%=MOD; } } for(int j=0;j<cnt;j++)dp[now][j]=0; now^=1; } int ans=0; for(int i=0;i<cnt&&state[i]<tot;i++) { ans+=dp[now][i]; ans%=MOD; } printf("%d\n",ans); } return 0;}
- POJ3254 Corn Fields(DP)
- 【DP】 poj3254 Corn Fields
- DP poj3254 Corn Fields
- poj3254 Corn Fields (状态压缩dp)
- poj3254(Corn Fields)状压dp
- poj3254--Corn Fields(状压dp)
- POJ3254 Corn Fields (状态压缩DP)
- poj3254 Corn Fields(状压dp)
- POJ3254 Corn Fields(状态DP)
- 【POJ3254】Corn Fields(状态压缩DP)
- POJ3254-Corn Fields(状压DP)
- POJ3254:Corn Fields(状压dp入门)
- 【poj3254】Corn Fields(状压dp)
- Poj3254 Corn Fields (状压Dp)
- poj3254 Corn Fields(状压dp)
- POJ3254-Corn Fields(状压dp)
- poj3254:Corn Fields(状压DP)
- 【状压DP】Corn Fields POJ3254
- 为python virtualenv安装exe依赖
- Yii2.0文件上传
- 组播 广播 单播
- Vue.js入门学习(1)
- javascript中foreach的用法
- POJ3254 Corn Fields(DP)
- 面向对象与面向过程
- Java-JSP页面 嵌入高德地图
- JAVA CAS原理深度分析
- Swift语法精炼(1)-基础数据类型,元组,可选类型
- "ActivityManager(xxxx): Config changes..."引起前端Activity重启(正常生命周期结束,正常生命周期启动)
- Spring IOC注入(一)set方式注入
- 软件工程的意识
- GIT分支间切换