# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034071 | BuiDucManh123 | Tents (JOI18_tents) | C++14 | 61 ms | 82772 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>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define taskname ""
using namespace std;
const int mod=1e9+7;
ll n,m,i,j,dp[5009][5009];
int main() {
if (fopen(taskname".inp","r")) {
freopen(taskname".inp","r",stdin);
freopen(taskname".out","w",stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
dp[0][0]=1;
for(i=1;i<=m;i++)
dp[0][i]=1;
for(i=1;i<=n;i++)
for(j=0;j<=m;j++){
//TH1:
dp[i][j]=dp[i-1][j];
//TH2:
if(j>=2) dp[i][j]+=dp[i-1][j-2]*j*(j-1)/2;
//TH3:
dp[i][j]+=dp[i-1][j-1]*j*4;
if(i>=2) dp[i][j]+=dp[i-2][j-1]*j*(i-1);
dp[i][j]%=mod;
}cout<<(dp[n][m]+mod-1)%mod;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |