CF 903F - Clear The Matrix 状态压缩DP

题意：

给你一个4 * n的矩阵，每个格子要么是*要么是.。现在要把所有的*变成.，每次可以用1*1，2*2，3*3，4*4的矩阵覆盖所有的*使他们变成.。这四种矩阵各有花费，问最小花费。

题解：

状态压缩DP。

设d[i][j]表示当前在第i列， 第i, i + 1, i + 2， i + 3的状态，为*表示1，为.表示0。

有两种转移， 一种是在第i列，用以第i列开始的矩阵覆盖，还有一种是第i列转移到第i + 1列。

复杂度是 ，大概是1e9，直接交T了，加了一个减支：if(dp[i][j] == INF) continue;以后就78ms过了。。

代码：

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <bitset>
#include <map>
#include <vector>
#include <stack>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#ifdef LOCAL
#define debug(x) cout<<#x<<" = "<<(x)<<endl;
#else
#define debug(x) 1;
#endif

#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define lson id<<1,l,mid
#define rson id<<1|1,mid+1,r
#define lowbit(x) x&-x
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, int> pii;

const ll MOD = 1e9 + 7;
const double eps = 1e-10;
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fll;
const int MAXN = 5e3 + 5;

int cost[5];
char s[5][1050];

int d[2][1 << 16];
int n;
vector<int> f[5];

void init() {
    for (int i = 1; i <= 4; i++) {
        for (int l = 0; l + i <= 4; l++) {
            int v = (1 << (4 * 4) ) - 1;
            for (int j = l; j < i + l; j++)
                for (int k = 0; k < i; k++) v ^= ( 1 << (k * 4 + j) );
            f[i].pb (v);
        }
    }
}

int main() {
#ifdef LOCAL
    freopen ("input.txt", "r", stdin);
#endif
    scanf ("%d", &n);
    for (int i = 1; i <= 4; i++) scanf ("%d", &cost[i]);
    for (int i = 0; i < 4; i++) scanf ("%s", s[i]);
    init();
    int sta = 0;
    for (int i = 0; i < 4; i++) {
        for (int j = 0; j < 4; j++) {
            if (s[i][j] == '*') sta |= (1 << (j * 4 + i) );
        }
    }
    memset (d, 0x3f, sizeof (d) );
    d[0][sta] = 0;
    int up = (1 << 0) + (1 << 1) + (1 << 2) + (1 << 3);
    for (int i = 0; i < n; i++) {
        int id = i & 1;
        for (int j = (1 << 16) - 1; j >= 0; j--) {
            if(d[id][j] == INF) continue;
            if (!(j & up)) {
                int tmp = j >> 4;
                for(int k = 0; k < 4; k++) if(s[k][i + 4] == '*') tmp |= (1 << (4 * 3 + k));
                d[id ^ 1][tmp] = d[id][j];
            }
            for (int k = 1; k <= 4; k++) {
                for (int l : f[k]) d[id][j & l] = min (d[id][j & l], d[id][j] + cost[k]);
            }
        }
        memset (d[id], 0x3f, sizeof (d[id]) );
    }
    printf("%d\n", d[n&1][0]);
    return 0;
}