oj.uz

Submission #443562

# Submission time Handle Problem Language Result Execution time Memory
443562 2021-07-10T20:01:59 Z nafis_shifat Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 32 ms 31692 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=2e3+5;
const int inf=1e9;
const ll mod = 1e9 + 7;
int main() {

    int n,cf,cs;

    cin >> n >> cf >> cs;


    ll dp[n + 1][n + 1] = {};


    dp[1][1] = 1;
    int k = (1 == cs || 1 == cf);

    for(ll i = 2; i <= n; i++) {
        if(i == cf || i == cs) k++;
        for(ll j = 1; j <= i; j++) {
            if(i == cf || i == cs) {
                dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % mod;
                continue;
            }
            dp[i][j] = (j - k) * dp[i - 1][j - 1]  % mod;
            dp[i][j] += j * dp[i - 1][j + 1] % mod;
            dp[i][j] %= mod;
        }
    }

    cout<<dp[n][1]<<endl;

}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 4 ms 3596 KB Output is correct
22 Correct 4 ms 4044 KB Output is correct
23 Correct 4 ms 4684 KB Output is correct
24 Correct 32 ms 31564 KB Output is correct
25 Correct 31 ms 31692 KB Output is correct
26 Correct 31 ms 31536 KB Output is correct
27 Correct 30 ms 31340 KB Output is correct
28 Correct 17 ms 17868 KB Output is correct