农夫约翰的土地由 M×N 个小方格组成,现在他要在土地里种植玉米。
非常遗憾,部分土地是不育的,无法种植。
而且,相邻的土地不能同时种植玉米,也就是说种植玉米的所有方格之间都不会有公共边缘。
现在给定土地的大小,请你求出共有多少种种植方法。
土地上什么都不种也算一种方法。
输入格式
第 1 行包含两个整数 M 和 N。
第 2..M+1 行:每行包含 N 个整数 0 或 1,用来描述整个土地的状况,1 表示该块土地肥沃,0 表示该块土地不育。
输出格式
输出总种植方法对 1e8 取模后的值。
数据范围
1≤M,N≤12
输入样例:
2 3
1 1 1
0 1 0
输出样例:
9
输入样例:
12 3
1 1 1
1 1 0
1 0 1
0 1 1
1 1 0
1 1 1
1 0 0
1 1 1
1 0 1
1 1 1
0 1 0
1 0 0
输出样例:
264600
输入样例:
4 10
0 1 1 1 1 1 1 1 1 1
1 1 1 0 1 1 1 1 1 1
1 1 1 1 1 1 0 1 1 1
0 0 1 1 1 1 1 1 1 0
输出样例:
4402955
使用的模板如下:
#include<bits/stdc++.h>
using namespace std; using ll = long long;
int dir[4][2] = { 1, 0, -1, 0, 0, 1, 0, -1 };
//using lll = __int128; template <class T> istream& read(T& x, istream& cin = std::cin) { T num = 0; bool f = 0; char ch = 0; while (!isdigit(ch)) { f |= ch == '-'; if (!cin.get(ch)) return cin; }while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch ^ 48); if (!cin.get(ch)) break; }x = f ? -num : num; return cin; }template <class T> ostream& write(T x, ostream& cout = std::cout) { if (x < 0) cout.put('-'), x = -x; if (x > 9) write(x / 10); cout.put(x % 10 + '0'); return cout; }ostream& operator<<(ostream& cout, lll x) { write(x); return cout; }istream& operator>>(istream& cin, lll& x) { return read(x); }bool check(int i, int j);
bool check(int i, int j);
const int N = 1e5 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m;
void init() {
cin >> n;
return;
}
void solve() {
return;
}
int main(void) {
ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(6) << fixed;
int TT = 1;
//cin >> TT;
for (int ii = 1; ii <= TT; init(), solve(), ii++, cout << "\n") {}
return 0;
}
这题不用优化也能过,dp[i][j]表示第 i 行第 j 中种法的数量,j 的二进制为 1 的表示种植
#include<bits/stdc++.h>
using namespace std; using ll = long long;
int dir[4][2] = { 1, 0, -1, 0, 0, 1, 0, -1 };
//using lll = __int128; template <class T> istream& read(T& x, istream& cin = std::cin) { T num = 0; bool f = 0; char ch = 0; while (!isdigit(ch)) { f |= ch == '-'; if (!cin.get(ch)) return cin; }while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch ^ 48); if (!cin.get(ch)) break; }x = f ? -num : num; return cin; }template <class T> ostream& write(T x, ostream& cout = std::cout) { if (x < 0) cout.put('-'), x = -x; if (x > 9) write(x / 10); cout.put(x % 10 + '0'); return cout; }ostream& operator<<(ostream& cout, lll x) { write(x); return cout; }istream& operator>>(istream& cin, lll& x) { return read(x); }bool check(int i, int j);
const int N = 15, mod = 1e8, INF = 0x3f3f3f3f;
int n, m, g[N][N], dp[N][1 << N];
bool check(int i, int j, int nn) {
if (i & j) return false;
for (int ii = 0; ii < m; ii++) {
if ((i >> ii & 1) && (!g[nn][ii + 1] || (i >> (ii + 1) & 1))) {
return false;
}
}
return true;
}
void init() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> g[i][j];
}
}
dp[0][0] = 1;
return;
}
void solve() {
for (int i = 1; i <= n + 1; i++) {
for (int j = 0; j < 1 << m; j++) {
for (int k = 0; k < 1 << m; k++) {
if (check(j, k, i)) {
dp[i][j] += dp[i - 1][k];
}
}
}
}
//ll res = 0;
//for (int i = 0; i < 1 << m; i++) {
// if (check(i, 0, n))
// res += dp[n][i];
//}
//cout << res;
cout << dp[n + 1][0] % mod;
return;
}
int main(void) {
ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(6) << fixed;
int TT = 1;
//cin >> TT;
for (int ii = 1; ii <= TT; init(), solve(), ii++, cout << "\n") {}
return 0;
}
优化代码如下
#include<bits/stdc++.h>
using namespace std; using ll = long long;
int dir[4][2] = { 1, 0, -1, 0, 0, 1, 0, -1 };
//using lll = __int128; template <class T> istream& read(T& x, istream& cin = std::cin) { T num = 0; bool f = 0; char ch = 0; while (!isdigit(ch)) { f |= ch == '-'; if (!cin.get(ch)) return cin; }while (isdigit(ch)) { num = (num << 3) + (num << 1) + (ch ^ 48); if (!cin.get(ch)) break; }x = f ? -num : num; return cin; }template <class T> ostream& write(T x, ostream& cout = std::cout) { if (x < 0) cout.put('-'), x = -x; if (x > 9) write(x / 10); cout.put(x % 10 + '0'); return cout; }ostream& operator<<(ostream& cout, lll x) { write(x); return cout; }istream& operator>>(istream& cin, lll& x) { return read(x); }bool check(int i, int j);
const int N = 15, mod = 1e8, INF = 0x3f3f3f3f;
ll n, m, g[N][N], dp[N][1 << N];
vector<int> gg[1 << N], state;
bool check(int i, int j, int nn) {
if (i & j) return false;
for (int ii = 0; ii < m; ii++) {
if ((i >> ii & 1) && (!g[nn][ii + 1] || (i >> (ii + 1) & 1))) {
return false;
}
}
return true;
}
void init() {
cin >> n >> m;
for (int i = 0; i <= m; i++) //把第 0 行的玉米田都初始化为可以种的状态,方便后面使用
g[0][i] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> g[i][j];
}
}
for (int j = 0; j < 1 << m; j++) { //把一行中所有合法的种法找出(假设所有的田都能种)
if (check(j, 0, 0)) {
state.emplace_back(j);
}
}
for (auto& ra : state) { //找出所有能转移的状态
for (auto& rb : state) {
if (!check(ra, rb, 0)) continue;
gg[ra].emplace_back(rb);
}
}
dp[0][0] = 1;
return;
}
void solve() {
for (int i = 1; i <= n + 1; i++) {
for (auto& ra : state) {
if (check(ra, 0, i)) //考虑有的田不能种
for (auto& rb : gg[ra]) {
dp[i][ra] += dp[i - 1][rb];
}
}
}
//ll res = 0;
//for (int i = 0; i < 1 << m; i++) {
// if (check(i, 0, n))
// res += dp[n][i];
//}
//cout << res % mod;
cout << dp[n + 1][0] % mod;
return;
}
int main(void) {
ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(6) << fixed;
int TT = 1;
//cin >> TT;
for (int ii = 1; ii <= TT; init(), solve(), ii++, cout << "\n") {}
return 0;
}