# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
400729 | hltk | Kangaroo (CEOI16_kangaroo) | C++17 | 36 ms | 16808 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 M 1000000007
int n, cs, cr, dp[2111][2111];
void mAdd(int &a, int b) { a += b; if (a >= M) a -= M; }
int main() {
scanf("%d %d %d", &n, &cs, &cr);
dp[1][1] = 1;
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (i == cs || i == cr) {
dp[i][j] = dp[i - 1][j];
mAdd(dp[i][j], dp[i - 1][j - 1]);
} else {
mAdd(dp[i][j], 1ll * dp[i - 1][j - 1] * (j - (i > cs) - (i > cr)) % M);
mAdd(dp[i][j], 1ll * dp[i - 1][j + 1] * j % M);
}
}
}
printf("%d\n", dp[n][1]);
}
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... |