# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997219 | goduadzesaba | Tents (JOI18_tents) | C++17 | 40 ms | 71024 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=3e3+5,mod=1e9+7;
int n,m,dp[N][N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n>>m;
for (int i=0; i<=n; i++) dp[i][0]=1;
for (int j=0; j<=m; j++) dp[0][j]=1;
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++){
dp[i][j]=dp[i-1][j];
if (j>1) dp[i][j]+=dp[i-1][j-2]*j*(j-1)/2;
dp[i][j]+=dp[i-1][j-1]*4*j;
if (i>1) dp[i][j]+=dp[i-2][j-1]*j*(i-1);
dp[i][j]%=mod;
}
cout<<dp[n][m]-1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |