POJ 3254 Corn Fields (状压)
来源:互联网 发布:unity3d base64 编辑:程序博客网 时间:2024/06/05 10:43
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
下面链接题解很清楚
参考链接 : http://www.cnblogs.com/void/articles/2072601.html
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<stack>#include<vector>#include<set>#include<map>#define L(x) (x<<1)#define R(x) (x<<1|1)#define MID(x,y) ((x+y)>>1)#define eps 1e-8typedef __int64 ll;#define fre(i,a,b) for(i = a; i <b; i++)#define fro(i,a,b) fro(i = b; i >=a; i--)#define mem(t, v) memset ((t) , v, sizeof(t))#define sfs(a) scanf("%s", a);#define sf(n) scanf("%d", &n)#define sff(a,b) scanf("%d %d", &a, &b)#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)#define pf printf#define bug pf("Hi\n")using namespace std;#define INF 0x3f3f3f3f#define N 1<<12#define mod 100000000int dp[12][N],h[N],type[N];int num,n,m;bool judge(int x){if(x&(x<<1)) return false;return true;}void inint(){int len=1<<m,i; fre(i,0,len) if(judge(i))type[num++]=i;}int main(){int i,j,t;while(~sff(n,m)){mem(h,0);fre(i,0,n) fre(j,0,m) { int x; sf(x); if(x==0) h[i]|=1<<j; }num=0;inint(); mem(dp,0); fre(i,0,num) if((h[0]&type[i])==0){dp[0][i]=1;} fre(i,1,n) fre(j,0,num) { if(h[i]&type[j]) continue; fre(t,0,num) { if((h[i-1]&type[t])||(type[j]&type[t])) continue; dp[i][j]=(dp[i][j]+dp[i-1][t])%mod; } }int ans=0;fre(i,0,num) ans=(ans+dp[n-1][i])%mod;pf("%d\n",ans);}return 0;}
- POJ 3254 Corn Fields(状压dp)
- POJ 3254 Corn Fields(状压dp)
- POJ 3254-Corn Fields(状压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 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(状压)
- poj 3254Corn Fields
- POJ 3254 Corn Fields
- (hdu step 6.1.3)畅通工程(求需要添加多少条边才能让n个点连通)
- 将本地代码库和Github同步
- 1000~2000年的闰年
- mac通过ssh上传文件到linux ubuntu虚拟机
- Build Project’has encoutered a problem. 解决方法
- POJ 3254 Corn Fields (状压)
- Linux locale详解
- 31、MySQL-数值函数
- http
- VirtualBox开机自动挂载
- Android SlidingMenu侧滑菜单使用
- 32、MySQL-字符串函数
- acm2020
- 33、MySQL-时间函数