oj.uz

Submission #903442

# Submission time Handle Problem Language Result Execution time Memory
903442 2024-01-11T07:46:57 Z Spade1 Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 27 ms 31756 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll ll>
#define st first
#define nd second
#define pb push_back
using namespace std;

const int maxN = 2e3 + 2;
const int M = 1e9 + 7;

ll dp[maxN][maxN];

void solve() {
    int n, cf, cs, ct = 0; cin >> n >> cf >> cs;
    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        if (i == cf || i == cs) ct++;
        for (int j = 1; j <= n; ++j) {
            if (i == cf || i == cs)
                dp[i][j] = (dp[i][j] + dp[i-1][j] + dp[i-1][j-1]) % M;
            else {
                dp[i][j] = (dp[i][j] + (j-ct)*dp[i-1][j-1]) % M;
                dp[i][j] = (dp[i][j] + j*dp[i-1][j+1]) % M;
            }
        }
    }
    cout << dp[n][1] << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) solve();
}

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 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 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 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 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 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1376 KB Output is correct
15 Correct 1 ms 1376 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 2 ms 1372 KB Output is correct
19 Correct 1 ms 1536 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 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 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1376 KB Output is correct
15 Correct 1 ms 1376 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 2 ms 1372 KB Output is correct
19 Correct 1 ms 1536 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 4 ms 7004 KB Output is correct
23 Correct 5 ms 7772 KB Output is correct
24 Correct 26 ms 31756 KB Output is correct
25 Correct 25 ms 31568 KB Output is correct
26 Correct 27 ms 31568 KB Output is correct
27 Correct 25 ms 31572 KB Output is correct
28 Correct 16 ms 23900 KB Output is correct