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

    基本的状压DP。。。

    Corn Fields
    Time Limit: 2000MSMemory Limit: 65536K
    Total Submissions: 5554Accepted: 2944

    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



     

    #include <iostream>
    #include <cstring>
    #include <cstdio>

    using namespace std;

    const int MOD=100000000;

    int dp[15][1<<14];
    int a[15][15],m,n;

    bool NowisOK(int r,int x)
    {
        for(int i=0;i<n;i++)
        {
            if(i+1<n)
            {
                if(((x>>i)&1)&&((x>>(i+1))&1))
                {
                    return false;
                }
            }
        }
        for(int i=0;i<n;i++)
        {
            if(((x>>i)&1)&&a
    ==0)
            {
                return false;
            }
        }
        return true;
    }

    int main()
    {
        scanf("%d%d",&m,&n);
        for(int i=1;i<=m;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf("%d",&a[j]);
            }
        }
        for(int i=1;i<=m;i++)
        {
            for(int x=0;x<(1<<n);x++)
            {
                if(!NowisOK(i,x)) continue;
                if(i==1)
                {
                    dp[1][x]=1;
                }
                else for(int j=0;j<(1<<n);j++)
                {
                    if((x&j)==0)
                    {
                        dp[x]=(dp[x]+dp[i-1][j])%MOD;
                    }
                }
            }
        }
        int ans=0;
        for(int i=0;i<(1<<n);i++)
        {
            ans=(ans+dp
    )%MOD;
        }
        printf("%d ",ans);
        return 0;
    }
    * This source code was highlighted by YcdoiT. ( style: Codeblocks )
  • 相关阅读:
    hdu 1269 迷宫城堡(强联通分量,基础)
    hdu 2102 A计划(BFS,基础)
    python 变量命名规范
    rpm常用选项
    memcached
    session共享
    Nginx高级使用
    nginx 反向代理
    Nginx基本使用
    github 建立博客
  • 原文地址:https://www.cnblogs.com/CKboss/p/3350831.html
Copyright © 2011-2022 走看看