提出 #4314570

---

ソースコード 拡げる

#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


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

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

提出情報

ジャッジ結果