玉米田

玉米田

具体代码如下

#include<iostream>
#include<cstring>
#include<vector>

using namespace std;

const int N = 14, M = 1 << N, mod = 1e8;

int n, m;
int g[N];
int f[N][M];
vector<int> state;
vector<int> head[M];

bool check(int state){
    
    if((state << 1) & state || (state >> 1) & state) return false;
    return true;
}

int main(){
    
    cin >> n >> m;
    for(int i = 1; i <= n; ++ i)
        for(int j = 0; j < m; ++ j){
            
            int t;
            cin >> t;
            g[i] += !t << j; //g[i]是一个二进制数，该位为1表示此位置不能填
        }
    for(int i = 0; i < 1 << m; ++ i)
        if(check(i))
            state.push_back(i);
            
    for(int i = 0; i < state.size(); ++ i)
        for(int j = 0; j < state.size(); ++ j){
            
            int a = state[i], b = state[j];
            if((a & b) == 0)
                head[i].push_back(j);
        }
        
    f[0][0] = 1;
    for(int i = 1; i <= n + 1; ++ i)
        for(int a = 0; a < state.size(); ++ a)
            if(!(state[a] & g[i]))
                for(auto b : head[a])
                    f[i][a] = (f[i][a] + f[i - 1][b]) % mod;

               
    cout << f[n + 1][0] << endl;
    
    return 0;
}