oj.uz

Submission #587231

# Submission time Handle Problem Language Result Execution time Memory
587231 2022-07-01T14:04:56 Z Jarif_Rahman Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 31 ms 31712 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

const ll md = 1e9+7;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, s, e; cin >> n >> s >> e; s--, e--;

    vector<vector<ll>> dp(n, vector<ll>(n+1, 0));
    dp[0][1] = 1;

    for(int i = 1; i < n; i++) for(int j = 1; j <= i+1; j++) {
        int c = 0;
        c+=(s < i);
        c+=(e < i);

        if(j > 1) dp[i][j]+=dp[i-1][j-1], dp[i][j]%=md;

        if(i == s || i == e){
            if(c == 0) dp[i][j]+=(dp[i-1][j]*j)%md, dp[i][j]%=md;
            else if(i == n-1 && j == 1) dp[i][j]+=dp[i-1][j], dp[i][j]%=md;
            else if(j != 1) dp[i][j]+=(dp[i-1][j]*(j-1))%md, dp[i][j]%=md;
        }
        else if(j+1 <= i){
            if(c == 0) dp[i][j]+=(dp[i-1][j+1]*j*(j+1))%md, dp[i][j]%=md;
            else if(c == 1) dp[i][j]+=(dp[i-1][j+1]*j*j)%md, dp[i][j]%=md;
            else if(i == n-1 && j == 1) dp[i][j]+=dp[i-1][j+1], dp[i][j]%=md;
            else if(j != 1) dp[i][j]+=(dp[i-1][j+1]*j*(j-1))%md, dp[i][j]%=md;
        }
    }

    cout << dp[n-1][1] << "\n";
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 232 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 0 ms 324 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 232 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 580 KB Output is correct
20 Correct 1 ms 596 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 232 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 580 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 3 ms 3668 KB Output is correct
22 Correct 4 ms 4180 KB Output is correct
23 Correct 4 ms 4692 KB Output is correct
24 Correct 26 ms 31688 KB Output is correct
25 Correct 26 ms 31712 KB Output is correct
26 Correct 31 ms 31700 KB Output is correct
27 Correct 26 ms 31444 KB Output is correct
28 Correct 15 ms 17876 KB Output is correct