# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474833 | ntabc05101 | Kangaroo (CEOI16_kangaroo) | C++14 | 1 ms | 332 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>
using namespace std;
#define taskname "kangaroo"
const int mxN = 2000;
const int mod = 1e9 + 7;
int n, cs, cf;
int dp[mxN + 5][mxN + 5];
int main() {
if (fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
cin >> n >> cs >> cf;
dp[1][1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == cs || i == cf) {
dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % mod;
}
else {
dp[i][j] = 1ll * dp[i - 1][j + 1] * j % mod;
(dp[i][j] += 1ll * dp[i - 1][j - 1] * (j - (i > cs) - (i > cf))) %= mod;
}
}
}
cout << dp[n][1] << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |