Submission #4330107

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"

using namespace std;

const long long int MOD = 1000000007;
//const int MOD = 998244353;

long long int N, M, K, H, W, L, R;
//int N, M, K, H, W, L, R

long long int power(long long int x, long long int n, long long int M) {
	long long int tmp = 1;

	if (n > 0) {
		tmp = power(x, n / 2, M);
		if (n % 2 == 0) tmp = (tmp*tmp) % M;
		else tmp = (((tmp*tmp) % M)*x) % M;
	}
	return tmp;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N >> K;
	vector<vector<long long int>>dp(N + 2, vector<long long int>(2));
	vector<long long int>by(N + 2);
	for (long long int i = 0; i <= N+1; i++) {
		by[i] = power(2, max(0LL, i)*max(0LL, i - 1) / 2, MOD);
	}
	dp[0][1] = 1;
	for (long long int i = 1; i <= N + 1; i++) {
		for (int j = 0; j < 2; j++) {
			for (int k = 0; k < i; k++) {
				//dp[i][j] += dp[k][j ^ 1] * power(2, max(0LL, i - k - 1 - K)*max(0LL, i - k - K) / 2, MOD);
				dp[i][j] += dp[k][j ^ 1] * by[max(0LL,i - k - K)];
				dp[i][j] %= MOD;
			}
		}
	}
	cout << (MOD + dp.back()[0] - dp.back()[1]) % MOD << endl;
	return 0;
}

Submission Info

Judge Result