poj 3254 Corn Fields
来源:互联网 发布:淘宝商城童装女童冬装 编辑:程序博客网 时间:2024/05/29 12:56
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<stdlib.h>
#include<iostream>
#include<string.h>
#include<queue>
#define inf 1e9
using namespace std;
int map[110][110];
int dp[110][1<<13];
int vec[110][1<<13];
int n,m;
int fun( int x )
{
int s=0;
for( int i=1;i<=m;i++ )
{
if( map[x][i]==0 )
s+=( 1<<( m-i ) );
}
return s;
}
int main()
{
int i, j, k, t;
while( scanf( "%d%d",&n,&m )!=-1 )
{
memset( vec,0,sizeof( vec ) );
memset( dp,0,sizeof( dp ) );
for( i=1;i<=n;i++ )
{
for( j=1;j<=m;j++ )
{
scanf( "%d",&map[i][j] );
}
}
vec[0][0]=1;
k=1<<m;
for( i=0;i<k;i++ )
{
dp[0][i]=1;
}
for( i=1;i<=n;i++ )
{
int tmp=fun( i );
int q=1;
for( j=0;j<k;j++ )
{
if( j&(j>>1) )
continue;
if( j&tmp )
continue;
vec[i][q++]=j;
}
vec[i][0]=q-1;
for( j=1;j<=vec[i][0];j++ )
{
int u=vec[i][j];
for( int z=1;z<=vec[i-1][0];z++ )
{
int v=vec[i-1][z];
if( u&v )
continue;
dp[i][u]=( dp[i][u]+dp[i-1][v] )%100000000;
}
}
}
int ans=0;
for( i=0;i<k;i++ )
{
ans=( ans+dp[n][i] )%100000000;
}
printf( "%d\n",ans );
}
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
- json模块
- kvm虚拟化学习笔记(七)之kvm虚拟机克隆
- phonegap+极光推送+页面跳转
- socket通信基本流程
- C++学习之一:构造函数
- poj 3254 Corn Fields
- 在Thinkphp中使用Soap
- ArcGIS教程:遥感图像预处理
- T0605——二维图形类,长方形类
- Intellij IDEA解决GBK乱码
- hdu2550 百步穿杨
- iOS开发之缓存:本地缓存机制之一
- CentOS 6.4 编译安装 gcc-4.8.0
- MyBatis中批量插入