poj3254 Corn Fields 利用状态压缩求方案数;
2015-11-25 13:32
381 查看
Corn Fields
2015-11-25 13:42:33
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
Sample Output
Hint
Number the squares as follows:
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
poj3254 Corn Fields 利用状态压缩d求方案数;
http://poj.org/problem?id=3254
View Code
2015-11-25 13:42:33
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 10658 | Accepted: 5602 |
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
poj3254 Corn Fields 利用状态压缩d求方案数;
http://poj.org/problem?id=3254
View Code
相关文章推荐
- mysql union和union all的区别
- MIUI7的优化。
- SQL注入攻击
- python进行crc校验的方法小感
- 第13周项目3-Dijkstra算法的验证
- poj1847Tram【floyd】
- Android自定义ProgressDialog
- 安装arm-none-linux-gnueabi交叉编译器
- java 多线程归纳整理
- haproxy(2)
- Codeforces Round #333 (Div. 1) C. Kleofáš and the n-thlon 树状数组优化dp
- 模拟IC应届生都这么牛,我想到了崩溃
- web安全之token
- VLFeat和Piotr’s Image & Video Matlab Toolbox
- leetcode_java_twosum
- 14.1 位图基础
- 数据库_MySQL_复杂的表结构创建
- 分享史上java最牛逼,最简短的代码
- java 访问权限使用总结
- Java压缩文件