#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=3010, LOG=20;
int n, m, k, u, v, x, y, t, a, b, ans;
ll dp[MAXN][MAXN];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>m;
for (int i=0; i<MAXN; i++) dp[i][0]=dp[0][i]=1;
for (int i=1; i<=n; i++){
for (int j=1; j<=m; j++){
dp[i][j]=(dp[i-1][j] + 4*j*dp[i-1][j-1])%mod;
if (j>1) dp[i][j]=(dp[i][j] + dp[i-1][j-2]*j*(j-1)/2)%mod;
if (i>1) dp[i][j]=(dp[i][j] + dp[i-2][j-1]*j*(i-1))%mod;
}
}
cout<<dp[n][m]-1<<"\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 2 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 3 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 4 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 5 |
Correct |
6 ms |
12652 KB |
Output is correct |
| 6 |
Correct |
7 ms |
12652 KB |
Output is correct |
| 7 |
Correct |
7 ms |
12652 KB |
Output is correct |
| 8 |
Correct |
6 ms |
12652 KB |
Output is correct |
| 9 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 10 |
Correct |
7 ms |
12908 KB |
Output is correct |
| 11 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 12 |
Correct |
8 ms |
13292 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 2 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 3 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 4 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 5 |
Correct |
6 ms |
12652 KB |
Output is correct |
| 6 |
Correct |
7 ms |
12652 KB |
Output is correct |
| 7 |
Correct |
7 ms |
12652 KB |
Output is correct |
| 8 |
Correct |
6 ms |
12652 KB |
Output is correct |
| 9 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 10 |
Correct |
7 ms |
12908 KB |
Output is correct |
| 11 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 12 |
Correct |
8 ms |
13292 KB |
Output is correct |
| 13 |
Correct |
6 ms |
12524 KB |
Output is correct |
| 14 |
Correct |
6 ms |
12564 KB |
Output is correct |
| 15 |
Correct |
80 ms |
56232 KB |
Output is correct |
| 16 |
Correct |
11 ms |
15340 KB |
Output is correct |
| 17 |
Correct |
22 ms |
22252 KB |
Output is correct |
| 18 |
Correct |
26 ms |
24684 KB |
Output is correct |
| 19 |
Correct |
90 ms |
63468 KB |
Output is correct |
| 20 |
Correct |
75 ms |
53228 KB |
Output is correct |
| 21 |
Correct |
51 ms |
39276 KB |
Output is correct |
| 22 |
Correct |
50 ms |
38892 KB |
Output is correct |
| 23 |
Correct |
31 ms |
27116 KB |
Output is correct |
| 24 |
Correct |
116 ms |
71020 KB |
Output is correct |
| 25 |
Correct |
91 ms |
63084 KB |
Output is correct |
| 26 |
Correct |
104 ms |
67564 KB |
Output is correct |
| 27 |
Correct |
113 ms |
69484 KB |
Output is correct |
