제출 #237776

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237776		sahil_k	Tents (JOI18_tents)	C++14	0 / 100	5 ms	384 KiB

tents

#include <iostream>
#define MOD 1000000007
using namespace std;
int dp_ind[3001][3001];
int dp_ttl[3001][3001];
int main () {
	int n, m;
	cin >> n >> m;
	for (int i=1; i<=n; i++) {
		for (int j=1; j<=m; j++) {
			dp_ind[i][j] = (4ll*(dp_ttl[i-1][j-1]+1))%MOD;
			for (int k=1; k<i; k++) {
				dp_ind[i][j] = (1ll*dp_ind[i][j]+1ll*(dp_ttl[k-1][j-1]+1)*(dp_ttl[i-k-1][j-1]+1))%MOD;
			}
			for (int k=1; k<j; k++) {
				dp_ind[i][j] = (1ll*dp_ind[i][j]+1ll*(dp_ttl[i-1][k-1]+1)*(dp_ttl[i-1][j-k-1]+1))%MOD;
			}
			dp_ttl[i][j] = (1ll*dp_ttl[i-1][j]+dp_ttl[i][j-1]-dp_ttl[i-1][j-1]+dp_ind[i][j]+MOD)%MOD;
		}
	}
	cout << dp_ttl[n][m] << endl;
}

• Subtask 1: 0 / 48
• Subtask 2: 0 / 52