# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306951 | vipghn2003 | Tents (JOI18_tents) | C++14 | 1 ms | 384 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 int long long
using namespace std;
const int N=3005;
const int mod=1e9+7;
int n,m,dp[N][N];
main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n>>m;
for(int j=0;j<=m;j++) dp[0][j]=1;
for(int j=0;j<=n;j++) dp[j][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
dp[i][j]=(dp[i-1][j]+dp[i-1][j-1]*m*4)%mod;
if(j>=2) dp[i][j]=(dp[i][j]+dp[i-1][j-2]*m*(m-1)/2)%mod;
if(i>=2) dp[i][j]=(dp[i][j]+dp[i-2][j-1]*m*(n-1))%mod;
}
}
cout<<(dp[n][m]-1+mod)%mod;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |