# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1147602 | raspy | Kangaroo (CEOI16_kangaroo) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define int long long
#define vi vector<int>
#define ii pair<int, int>
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define P 31
#define mod 1'000'000'007
#define inf 1'000'000'000'000
#define pb push_back
#define str string
#define sz(x) (x).size()
#define vvi vector<vi>
#define fun function
#define oopt cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
#define file freopen("problemname.in", "r", stdin); freopen("pr.out", "w", stdout);
#define dbg(v) cout << "Line(" << __LINE__ << ") -> " << #v << " = " << (v) << endl;
using namespace std;
template <class T, int SZ> using arr = array<T, SZ>;
int dp[2005][2005];
void solve()
{
int n, zc, kn;
cin >> n >> zc >> kn;
dp[0][0] = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j <= i; j++)
{
if (i+1 == zc || i+1 == kn)
{
dp[i+1][j+1] = (dp[i+1][j+1]+ dp[i][j] )%mod;
dp[i+1][j] = (dp[i+1][j]+ dp[i][j] )%mod;
}
else
{
if (j > 1)
dp[i+1][j+1] = (dp[i+1][j+1]+ dp[i][j]*(j-1) )%mod;
dp[i+1][j-1] = (dp[i+1][j-1]+ dp[i][j]*(j-1)+(i+1<a)+(i+1<b) )%mod;
}
}
cout << dp[n][1] << "\n";
}
signed main()
{
oopt;
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}