Submission #202189

#	Time	Username	Problem	Language	Result	Execution time	Memory
202189		nvmdava	Tents (JOI18_tents)	C++17	100 / 100	66 ms	70904 KiB

tents

#include <bits/stdc++.h>
long long dp[3005][3005], n, m, i, j;
int main(){
    std::cin>>n>>m;
    for(i = 0; i <= 3000; ++i)dp[i][0] = dp[0][i] = 1;
    for(i = 1; i <= n; ++i)for(j = 1; j <= m; ++j)dp[i][j] = (dp[i - 1][j] + (j >= 2 ? j * (j - 1) / 2 * dp[i - 1][j - 2] : 0) + 4 * j * dp[i - 1][j - 1] + (i >= 2 ? dp[i - 2][j - 1] * j * (i - 1) : 0)) % 1000000007;
    std::cout<<dp[n][m] - 1;
}

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