zoukankan      html  css  js  c++  java
  • [POJ 3254] Corn Fields

    Corn Fields
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 8326   Accepted: 4434

    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

    Line 1: Two space-separated integers: M and N  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

    Line 1: One integer: the number of ways that FJ can choose the squares modulo 100,000,000.

    Sample Input

    2 3
    1 1 1
    0 1 0

    Sample Output

    9

    Hint

    Number the squares as follows:
    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

    USACO 2006 November Gold
     
    经典状压DP、- -
    #include <iostream>
    #include <cstring>
    #include <cstdio>
    using namespace std;
    #define INF 0x7ffffff
    #define MOD 100000000
    
    int n,m;
    int a[13];
    int dp[13][5000];   
    
    bool judge(int row,int sta)            //判断第row行sta状态是否合法
    {
        if((a[row]&sta)!=sta) return 0;
        if(sta&(sta<<1) || sta&(sta>>1)) return 0;
        return 1;
    }
    
    void solve()
    {
        int i,j,k;
        int MAX=1<<m;
        dp[0][0]=1;
        for(i=1;i<=n;i++)
        {
            for(j=0;j<MAX;j++)
            {
                if(!judge(i,j)) continue;
                for(k=0;k<MAX;k++)
                {
                    if(j&k) continue;
                    dp[i][j]=(dp[i][j]+dp[i-1][k])%MOD;
                }
            }
        }
        int res=0;
        for(i=n,j=0;j<MAX;j++)
        {
            res=(res+dp[i][j])%MOD;
        }
        printf("%d
    ",res);
    }
    int main()
    {
        int i,j;
        while(scanf("%d%d",&n,&m)!=EOF)
        {
            memset(a,0,sizeof(a));
            memset(dp,0,sizeof(dp));
            for(i=1;i<=n;i++)
            {
                for(j=1;j<=m;j++)
                {
                    int x;
                    scanf("%d",&x);
                    a[i]=(a[i]<<1)+x;       //讲每一行的状态记录下来
                }
            }
            solve();
        }
        return 0;
    }
    趁着还有梦想、将AC进行到底~~~by 452181625
  • 相关阅读:
    超酷flv网页播放器 CKplayer V5.7
    div+css教程网站建设门户网站和电子商务网站CSS样式表
    jQuery页面滚动图片等元素动态加载实现
    eclipse关键字自动不全的设置方法[转载]
    jQuery Wookmark 瀑布流布局
    SuperSlide、zTree、KandyTabs、jQuery Slide Show 、Jcrop、jQuery Lazy Load、jQuery lightBox plugin等jquery特效
    hibernate配置文件hibernate.cfg.xml的解释
    有利于SEO的DIV+CSS的命名规则
    [转]JDK环境变量设置及相关,轻松解决Tomcat一闪而过
    网页素材大宝库:高质量的网站纹理背景素材
  • 原文地址:https://www.cnblogs.com/hate13/p/4099094.html
Copyright © 2011-2022 走看看