POJ 3254 Corn Fields
来源:互联网 发布:淘宝神笔编辑器 编辑:程序博客网 时间:2024/04/28 13:26
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.
#include<cstdio>#include<cstring>#define maxn 1<<12#define mod 100000000int dp[2][maxn];int main(){int M,N;int i,j,k,cur,pre,tmp,num;//freopen("e:\\in.txt","r",stdin);while(scanf("%d%d",&N,&M)==2){cur=1;memset(dp[cur],0,sizeof(dp[cur]));dp[cur][0]=1;for(i=1;i<=N;i++){pre=cur;cur=(pre+1)%2;memset(dp[cur],0,sizeof(dp[cur]));num=0;for(j=0;j<M;j++){scanf("%d",&tmp);if(tmp)num+=(1<<j);}for(j=0;j<(1<<M);j++){if((j&num)<j)continue;if(j&(j<<1))continue;for(k=0;k<(1<<M);k++){if(j&k)continue;dp[cur][j]=(dp[cur][j]+dp[pre][k])%mod;}}}int S=0;for(i=0;i<(1<<M);i++)S=(S+dp[cur][i])%mod;printf("%d\n",S);}return 0;}
- poj 3254Corn Fields
- POJ 3254 Corn Fields
- poj 3254 Corn Fields
- POJ 3254 Corn Fields
- poj 3254---Corn Fields
- poj 3254 Corn Fields
- poj 3254 Corn Fields
- POJ 3254 Corn Fields
- (poj)3254 Corn Fields
- poj 3254 Corn Fields
- POJ 3254 Corn Fields
- poj 3254 Corn Fields
- POJ 3254 Corn Fields
- poj 3254 Corn Fields
- POJ 3254 Corn Fields
- POJ 3254 Corn Fields
- poj-3254-Corn Fields
- poj 3254 Corn Fields
- 第一手知识——切身体验
- android 获取手机IMSI码 双卡双待手机
- OCP-1Z0-053-V12.02-469题
- Vmware10下安装Mac OS X Mountain Lion(10.8.5)
- 利用IAR Timeline工具测试delay函数执行时间
- POJ 3254 Corn Fields
- thrift Drools
- 线性代数导论32——基变换和图像压缩
- AAC 文件解析及解码流程
- springmvc中Model ModelAndView ModelMap Map 的理解
- 数据结构与算法系列-树-数的基本概念
- 【Java TCP/IP Socket】基于NIO的TCP通信(含代码)
- 用循环的方法求该年的第几天(2)这种方法很简单,但是有点难想
- 关联数组Map<...>