Submission #849729

# Submission time Handle Problem Language Result Execution time Memory
849729 2023-09-15T08:40:43 Z justinlgl20 Kangaroo (CEOI16_kangaroo) C++14
100 / 100
17 ms 31832 KB
#include <bits/stdc++.h>
using namespace std;

#define int long long

int dp[2005][2005];
const int MOD = 1000000007;

int32_t main() {
        int n, start, end;
        cin >> n >> start >> end;
        dp[1][1] = 1;
        for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= n; j++) {
                        if (i == 1 and j == 1) dp[i][j] = 1;
                        else if (i == 1) {dp[i][j] = 0; continue;}
                        else if (i != start and i != end) {
                                dp[i][j] = (int)(dp[i-1][j+1]*j)%MOD;
                                int k = j;
                                if (i > start) k -= 1;
                                if (i > end) k -= 1;
                                dp[i][j] += (int)(dp[i-1][j-1] * k)%MOD;
                        }
                        else {
                                dp[i][j] = dp[i-1][j-1];
                                dp[i][j]%=MOD;
                                dp[i][j] += dp[i-1][j];
                                dp[i][j]%=MOD;
                        }
                }
        }
        cout << dp[n][1] << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4640 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 2 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4640 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 2 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 3 ms 10584 KB Output is correct
22 Correct 3 ms 12632 KB Output is correct
23 Correct 3 ms 12632 KB Output is correct
24 Correct 17 ms 31832 KB Output is correct
25 Correct 17 ms 31576 KB Output is correct
26 Correct 16 ms 31580 KB Output is correct
27 Correct 17 ms 31576 KB Output is correct
28 Correct 11 ms 25180 KB Output is correct