Submission #2123882

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w

#define int long long
//typedef    long long          ll;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      P;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
 
const int INF=1e+18;
const double EPS=1e-9;
const int MOD=1000000007;
 
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

signed main(){
	int n,m,dp[2][1 << 15][2] = {},ans = 0,now = 0,nxt = 1;
	cin >> m >> n;
	dp[now][0][0] = 1;
	for(int i = 0;i < n;i++){
		for(int j = 0;j < m;j++){
			for(int k = 0;k < (1 << m);k++){
				dp[nxt][k][0] = 0;
				dp[nxt][k][1] = 0;
			}
			for(int k = 0;k < (1 << m);k++){
				if(!j){
					if(!((k >> j) & 1) && !((k >> (j + 1)) & 1)) (dp[nxt][k | (1 << j)][0] += dp[now][k][0] + dp[now][k][1]) %= MOD;
				}else{
					if(!((k >> j) & 1) && !((k >> (j - 1)) & 1) && !((k >> (j + 1)) & 1)) (dp[nxt][k | (1 << j)][0] += dp[now][k][0]) %= MOD;
				}
				(dp[nxt][k & ~(1 << j)][(k >> j) & 1] += dp[now][k][0] + dp[now][k][1]) %= MOD;
			}
			swap(now,nxt);
		}
	}
	for(int i = 0;i < (1 << m);i++) ans = (ans + dp[now][i][0] + dp[now][i][1]) % MOD;
	cout << (ans + MOD - 1) % MOD << endl;
	return 0;
}

Submission Info

Judge Result