oj.uz

Submission #946630

# Submission time Handle Problem Language Result Execution time Memory
946630 2024-03-14T20:28:48 Z vjudge1 Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 16 ms 16272 KB 
#include <bits/stdc++.h>
using namespace std;

using LL = long long;
using PII = pair<int, int>;

const int N = 4000;
const int M = 1e9 + 7;
int dp[N][N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, cs, cf;
    cin >> n >> cs >> cf;

    dp[1][1] = 1;

    for(int i = 2; i <= n; ++i){
        for(int j = 1; j <= i; ++j){
            if(i == cs or i == cf) dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
            else {
                dp[i][j] += 1LL * dp[i - 1][j + 1] * j % M ;                          //merging of two component
                dp[i][j] += 1LL * dp[i - 1][j - 1] * (j-2 + (i < cf) + (i < cs)) % M; // start of a new component
            }
            dp[i][j] %= M;
        } 
    }

    cout << dp[n][1]<<"\n";
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 0 ms 856 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 0 ms 856 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1232 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 0 ms 856 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1232 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 3 ms 3932 KB Output is correct
22 Correct 3 ms 4188 KB Output is correct
23 Correct 3 ms 4444 KB Output is correct
24 Correct 16 ms 16220 KB Output is correct
25 Correct 15 ms 16272 KB Output is correct
26 Correct 15 ms 16220 KB Output is correct
27 Correct 15 ms 16220 KB Output is correct
28 Correct 9 ms 10844 KB Output is correct