POJ 3254 Corn Fields（状态压缩）代码详解

爱玲姐姐

于 2018-02-23 13:52:03 发布

阅读量796

点赞数

分类专栏： POJ题解动态规划文章标签：动规DP 状态压缩二进制

本文链接：https://blog.youkuaiyun.com/jal517486222/article/details/79353003

版权

这篇博客详细解读了POJ 3254 Corn Fields的问题，这是一个关于在限制相邻种植的情况下，计算在MxN的田地中选择种植区域的动态规划问题。题目要求计算所有可能的种植方案数，并对结果取模100,000,000。博客内容包括输入输出描述、样例输入输出以及解决方案的讲解，涉及状态压缩和二进制技术的应用。" 84831685,1399972,CICS队列详解：TDQ与TSQ对比,"['CICS', '队列管理', '数据处理', '事务处理']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Corn Fields（POJ 3254）

Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 18002 Accepted: 9478
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