oj.uz

Submission #480893

# Submission time Handle Problem Language Result Execution time Memory
480893 2021-10-18T15:16:29 Z Joo Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 48 ms 22956 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const int N = 2e3+10;

int n,St,Ed;
ll dp[N][N],mod = 1e9+7;

int main(void){
    cin >> n >> St >> Ed;
    dp[1][1] = 1;
    for(int i = 1; i < n; i++){
        for(int j = 1; j <= i; j++){
            if(i + 1 == St or i + 1 == Ed){
                dp[i+1][j] += dp[i][j];
                dp[i+1][j] %= mod;
                dp[i+1][j+1] += dp[i][j];
                dp[i+1][j+1] %= mod;
            }else{
                dp[i+1][j-1] += dp[i][j]*(j-1);
                dp[i+1][j-1] %= mod;
                dp[i+1][j+1] += dp[i][j]*(j+1-(i >= St)-(i >= Ed));
                dp[i+1][j+1] %= mod;
            }
        }
    }
    cout << dp[n][1] << "\n";
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct
21 Correct 8 ms 4556 KB Output is correct
22 Correct 7 ms 4940 KB Output is correct
23 Correct 8 ms 5580 KB Output is correct
24 Correct 48 ms 22880 KB Output is correct
25 Correct 42 ms 22956 KB Output is correct
26 Correct 42 ms 22928 KB Output is correct
27 Correct 43 ms 22788 KB Output is correct
28 Correct 25 ms 15064 KB Output is correct