oj.uz

Submission #311309

# Submission time Handle Problem Language Result Execution time Memory
311309 2020-10-09T22:36:16 Z jainbot27 Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 39 ms 31616 KB 
#include "iostream"
using namespace std;

const int64_t MOD = 1e9 + 7;
int64_t dp[2001][2001];

int main(){
    int n, a, b;
    cin >> n >> a >> b;
    dp[0][0] = 1;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++){
            if(i == a || i == b) 
                dp[i][j] = (dp[i-1][j] + dp[i-1][j-1]) % MOD;
            else 
                dp[i][j] = (dp[i-1][j+1] * j + dp[i-1][j-1] * (j - (i > a) - (i > b))) % MOD;
        }
    cout << dp[n][1];
}

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 1 ms 1408 KB Output is correct
14 Correct 1 ms 1408 KB Output is correct
15 Correct 1 ms 1408 KB Output is correct
16 Correct 1 ms 1408 KB Output is correct
17 Correct 1 ms 1408 KB Output is correct
18 Correct 1 ms 1280 KB Output is correct
19 Correct 1 ms 1408 KB Output is correct
20 Correct 1 ms 1408 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 1 ms 1408 KB Output is correct
14 Correct 1 ms 1408 KB Output is correct
15 Correct 1 ms 1408 KB Output is correct
16 Correct 1 ms 1408 KB Output is correct
17 Correct 1 ms 1408 KB Output is correct
18 Correct 1 ms 1280 KB Output is correct
19 Correct 1 ms 1408 KB Output is correct
20 Correct 1 ms 1408 KB Output is correct
21 Correct 5 ms 6400 KB Output is correct
22 Correct 5 ms 6912 KB Output is correct
23 Correct 6 ms 7808 KB Output is correct
24 Correct 26 ms 31608 KB Output is correct
25 Correct 26 ms 31616 KB Output is correct
26 Correct 39 ms 31608 KB Output is correct
27 Correct 25 ms 31480 KB Output is correct
28 Correct 17 ms 23808 KB Output is correct