题目
题解
我们可以构造一个这样的矩阵
1 2 4 6 8 ...
3 6 12 18 24
9 18 36 54 72
27 ...
横排每一个数是左边的数的2倍,竖排每一个数是上边数的3倍,那么我们每在矩阵中选一个数,它上下左右相邻的数都不能选,那么这道题就变成了USACO06NOV玉米田Corn Fields,(USACO06NOV玉米田Corn Fields题解),我们可以把每次构造的矩形的数字记录下来,然后在 1 1 1~ n n n找没出现的数字,继续构造矩形 D P DP DP,根据乘法原理统计答案即可。
code
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxm = 20;
const int maxn = 1e5 + 100;
const int maxk = (1<<18) + 10;
const int mod = 1e9 + 1;
template <typename T>
inline void read(T &s) {
s = 0;
T w = 1, ch = getchar();
while (!isdigit(ch)) { if (ch == '-') w = -1; ch = getchar(); }
while (isdigit(ch)) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
s *= w;
}
LL n, end, ans; // end表示构造的矩形最多到第几行
LL l[maxm], g[maxk]; // l[i]表示第i行有几个数,g[i]表示状态i是否可行
LL f[maxm][maxk], a[maxm][maxm]; // f[i][j]表示第i行状态为j时的方案数,a[i][j]为构造的矩形
bool vis[maxn]; // vis[i] 表示数字i是否被选取
inline void matrix(LL x) { // 构造矩形
end = 0;
for (int i = 1; i <= 20; ++i) {
a[i][1] = (i == 1) ? x : a[i - 1][1] * 3;
if (a[i][1] > n) break;
end = i;
l[i] = 1;
vis[a[i][1]] = true;
for (int j = 2; j <= 20; ++j) {
a[i][j] = a[i][j - 1] * 2;
if (a[i][j] > n) break;
l[i] = j;
vis[a[i][j]] = true;
}
}
}
inline LL dp() {
for (int i = 0; i < (1<<l[1]); ++i)
f[1][i] = g[i];
for (int i = 2; i <= end; ++i) {
for (int j = 0; j < (1<<l[i]); ++j) {
if (!g[j]) continue;
f[i][j] = 0;
for (LL k = 0; k < (1<<(l[i-1])); ++k) {
if (!g[k]) continue;
if (k & j) continue;
f[i][j] += f[i - 1][k];
}
}
}
LL cnt = 0;
for (int i = 0; i < (1<<l[end]); ++i)
cnt = (cnt + f[end][i]) % mod;
return cnt;
}
int main() {
read(n);
for (int i = 0; i < (1<<18); ++i)
g[i] = !(i & (i<<1));
ans = 1;
for (int i = 1; i <= n; ++i) {
if (vis[i]) continue;
matrix(i);
ans = ans * dp() % mod;
}
printf("%lld\n", ans);
return 0;
}