# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126806 | PeppaPig | Kangaroo (CEOI16_kangaroo) | C++14 | 42 ms | 23032 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>
#define long long long
using namespace std;
const int N = 2e3+5;
const int M = 1e9+7;
int n, s, e;
long dp[N][N];
int main() {
scanf("%d %d %d", &n, &s, &e);
dp[1][1] = 1;
for(int i = 2; i <= n; i++) for(int j = 1; j <= i; j++) {
if(i == s || i == e) {
dp[i][j] = (dp[i][j] + dp[i-1][j]) % M;
dp[i][j] = (dp[i][j] + dp[i-1][j-1]) % M;
} else {
dp[i][j] = (dp[i][j] + dp[i-1][j+1] * j) % M;
dp[i][j] = (dp[i][j] + dp[i-1][j-1] * (j - (i > s) - (i > e))) % M;
}
}
printf("%lld\n", dp[n][1]);
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... |