oj.uz

Submission #954800

# Submission time Handle Problem Language Result Execution time Memory
954800 2024-03-28T14:47:35 Z DragosC1 Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 35 ms 16084 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1000000007;

int dp[2005][2005];

int main() {    
    int n, start, finish;
    cin >> n >> start >> finish;
    dp[0][0] = 1;
    bool has_start = 0;
    bool has_end = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            if (i == start || i == finish) {
                dp[i][j] = (1LL * dp[i][j] + dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
                if (i == start)
                    has_start = 1;
                if (i == finish)
                    has_end = 1;
            }
            else {
                dp[i][j] = (1LL * dp[i][j] + 1LL * (j - has_start - has_end) * dp[i - 1][j - 1] % MOD) % MOD;
                dp[i][j] = (1LL * dp[i][j] + 1LL * j * dp[i - 1][j + 1] % MOD) % MOD;
            }
        }
    cout << dp[n][1] << '\n';
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 348 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 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 420 KB Output is correct
10 Correct 1 ms 600 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 348 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 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 420 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1212 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 420 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1212 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 5 ms 4696 KB Output is correct
22 Correct 5 ms 4956 KB Output is correct
23 Correct 6 ms 5464 KB Output is correct
24 Correct 33 ms 16084 KB Output is correct
25 Correct 33 ms 15956 KB Output is correct
26 Correct 34 ms 15952 KB Output is correct
27 Correct 35 ms 16024 KB Output is correct
28 Correct 24 ms 12124 KB Output is correct