为什么全部re，在dev中可以啊！！求大佬

#include<cstdio>
#include<iostream>
#include<string>
using namespace std;

const int N = 101, M = 11;
int n, m, cnt, ans, num[1<<M], state[1<<M], dp[N][1<<M][1<<M];
string map[N];
int get_num(int x) {
    int count = 0;
    while (x) {
        if (x&1) count++;
        x>>=1;
    }
    return count;
}

void init() {
    int i, j, MAX = 1<<m;
    for (i = 0; i < MAX; i++) {
        if (i&(i<<1) || i&(i<<2) || i&(i>>1) || i&(i>>2)) continue;
        else {
            state[++cnt] = i;
            num[cnt] = get_num(i);
        }
    }
    return ;
}

bool judge(int cur, int s) {
    int i, l = map[cur].size();
    for (i = l-1; i >= 0; i--) {
        if (map[cur][i] == 'H' && s&1) return false;
        s>>=1;
    }
    return true;
}

int main() {
    int i, j, k, l, p;
    scanf("%d%d", &n ,&m);
    for (i = 1; i <= n; i++)
        cin >> map[i];
    init();
    for (i = 1; i <= cnt; i++) {
        if (!judge(1, state[i])) continue;
        dp[1][i][0] = num[i];
    }
    for (i = 1; i <= cnt; i++) {
        if (!judge(2, state[i])) continue;
        for (j = 1; j <= cnt; j++) {
            if (!judge(1, state[j])) continue;
            if (state[i]&state[j]) continue;
            dp[2][i][j] = dp[1][j][0] + num[i];
        }
    }
    for (i = 3; i <= n; i++) {
        for (j = 1; j <= cnt; j++) {
            if (!judge(i, state[j])) continue;
            for (k = 1; k <= cnt; k++) {
                if (!judge(i-1, state[k])) continue;
                if (state[k]&state[j]) continue;
                for (l = 1; l <= cnt; l++) {
                    if (!judge(i-2, state[l])) continue;
                    if (state[l]&state[k] || state[l]&state[j]) continue;
                    dp[i][j][k] = dp[i-1][k][l] + num[j];
                    ans = max(dp[i][j][k], ans);
                }
            }
        }
    }
    printf("%d", ans);
    return 0;
}