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;
const int maxn = 3005;
const int mod = 1e9 + 7;
int n, m;
bool bl[maxn][maxn];
long long dp[maxn][maxn];
long long f(int rows, int cols)
{
if (rows < 0 || cols < 0)
{
return 0;
}
if (rows == 0 || cols == 0)
{
return 1;
}
if (bl[rows][cols] == true)
{
return dp[rows][cols];
}
bl[rows][cols] = true;
long long ans = 0;
ans += f(rows - 1, cols);
ans %= mod;
ans += (4LL * cols) * f(rows - 1, cols - 1);
ans %= mod;
ans += ((1LL * cols) * (1LL * cols - 1LL) / 2LL) * f(rows - 1, cols - 2);
ans %= mod;
ans += (1LL * cols) * (1LL * (rows - 1)) * f(rows - 2, cols - 1);
ans %= mod;
return dp[rows][cols] = ans;
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fastIO();
cin >> n >> m;
cout << f(n, m) - 1 << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |