oj.uz

Submission #507468

# Submission time Handle Problem Language Result Execution time Memory
507468 2022-01-12T13:41:52 Z VladM Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 15 ms 22960 KB 
#include <bits/stdc++.h>

using namespace std;

#define modulo 1000000007

long long n, dp[2007][2007], f, cs, cf;

int main()
{
    cin>>n>>cs>>cf;
    if(cs>cf) swap(cs, cf);
    dp[0][0]=1;
    for(long long i=1; i<=n; i++){
        for(long long j=1; j<=i; j++){
            if(i==cs || i==cf){
                dp[i][j]=(dp[i-1][j-1]+dp[i-1][j])%modulo;
                continue;
            }
            if(i<cs) dp[i][j]=j*(dp[i-1][j-1]+dp[i-1][j+1]);
            else if(i<cf) dp[i][j]=dp[i-1][j-1]*(j-1)+dp[i-1][j+1]*j;
            else dp[i][j]=dp[i-1][j-1]*(j-2)+dp[i-1][j+1]*j;
            dp[i][j]%=modulo;
        }
    }
    cout<<dp[n][1];
    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 352 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 352 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 428 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 464 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 352 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 428 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 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 1196 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1196 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 1 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 352 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 428 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 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 1196 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1196 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 1 ms 1228 KB Output is correct
21 Correct 3 ms 4556 KB Output is correct
22 Correct 2 ms 4940 KB Output is correct
23 Correct 3 ms 5452 KB Output is correct
24 Correct 13 ms 22956 KB Output is correct
25 Correct 13 ms 22960 KB Output is correct
26 Correct 13 ms 22884 KB Output is correct
27 Correct 15 ms 22816 KB Output is correct
28 Correct 10 ms 15012 KB Output is correct