【BZOJ4000】【LOJ2104】【TJOI2015】棋盘（状压DP，矩阵快速幂）

Description

https://loj.ac/problem/2104
注意题中的编号是从$0$开始的。

---

Solution

用$f_{i,j}$表示第$i$行状态为$j$的方案数。
发现每一行的转移都是相同的，构造出矩阵后用快速幂优化即可。

---

Code

/**************************************
 * Au: Hany01
 * Prob: BZOJ4000 LOJ2104 TJOI2015棋盘
 * Date: Aug 18th, 2018
 * Email: hany01@foxmail.com
**************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef unsigned int uint;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = j; i < i##_end_; ++ i)
#define For(i, j ,k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define x first
#define y second
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define y1 wozenmezhemecaia 
#ifdef hany01
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    register char c_; register int _, __;
    for (_ = 0, __ = 1, c_ = getchar(); !isdigit(c_); c_ = getchar()) if (c_ == '-')  __ = -1;
    for ( ; isdigit(c_); c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

int n, m, p, k, atk[3], N;
uint Ans;

struct Matrix {
    uint a[1 << 6][1 << 6], x, y;
    inline uint* operator [] (int x) { return a[x]; }
}a, b;
inline Matrix operator * (Matrix A, Matrix B) {
    static Matrix C; C.x = A.x, C.y = B.y;
    rep(i, C.x) rep(j, C.y) {
        C[i][j] = 0;
        rep(k, A.y) C[i][j] += A[i][k] * B[k][j];
    }
    return C;
}
inline Matrix operator ^ (Matrix a, int b) {
    static Matrix Ans;
    Set(Ans.a, 0), Ans.x = Ans.y = a.x;
    rep(i, a.x) Ans[i][i] = 1;
    for ( ; b; b >>= 1, a = a * a) if (b & 1) Ans = Ans * a;
    return Ans;
}

inline bool ok(int st, int ct, int nst) {
    static int t;
    rep(i, m) if (st >> i & 1) {
        if (i >= k) t = (ct << (i - k)); else t = (ct >> (k - i));
        if (t & nst) return 0;
    }
    return 1;
}

inline bool ok1(int st, int ct) {
    static int t;
    rep(i, m) if (st >> i & 1) {
        if (i >= k) t = (ct << (i - k)); else t = (ct >> (k - i));
        if ((t & st) ^ (1 << i)) return 0;
    }
    return 1;
}

int main()
{
#ifdef hany01
    File("bzoj4000");
#endif

    n = read(), m = read(), p = read(), k = read();
    rep(i, 3) rep(j, p) atk[i] |= (read() << j);

    a.x = a.y = N = 1 << m;

    rep(i, N) if (ok1(i, atk[1])) rep(j, N) if (ok1(j, atk[1]))
        if (ok(i, atk[2], j) && ok(j, atk[0], i)) a[j][i] = 1;
    b.x = N, b.y = 1;
    rep(i, N) b[i][0] = 1;
    a = (a ^ (n - 1)) * b;
    rep(i, N) Ans += a[i][0];
    printf("%u\n", Ans);

    return 0;
}