oj.uz

Submission #813223

# Submission time Handle Problem Language Result Execution time Memory
813223 2023-08-07T14:22:32 Z Warinchai Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 62 ms 31656 KB 
#include<bits/stdc++.h>
using namespace std;
long long dp[2005][2005];
long long md=1e9+7;
int k;
int main(){
    int n,st,en;
    cin>>n>>st>>en;
    if(st==en){
        cout<<1;
    }
    dp[1][1]=1;
    for(int i=1;i<=n;i++){
        if(i==st||i==en){
            k++;
        }
        for(int j=1;j<=n;j++){
            if(i==st||i==en){
                dp[i][j+1]+=dp[i-1][j];
                dp[i][j]+=dp[i-1][j];
                dp[i][j]%=md;
                dp[i][j+1]%=md;

            }else{
                dp[i][j+1]+=dp[i-1][j]*(j+1-k);
                dp[i][j-1]+=dp[i-1][j]*(j-1);
                dp[i][j+1]%=md;
                dp[i][j-1]%=md;
            }
        }
    }
    cout<<dp[n][1];
   // cout<<"\n"<<k;
}

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 212 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 212 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 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 212 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 1336 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 2 ms 1328 KB Output is correct
20 Correct 2 ms 1364 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 212 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 1336 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 2 ms 1364 KB Output is correct
15 Correct 2 ms 1364 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 2 ms 1328 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 9 ms 6228 KB Output is correct
22 Correct 8 ms 6852 KB Output is correct
23 Correct 9 ms 7764 KB Output is correct
24 Correct 56 ms 31560 KB Output is correct
25 Correct 57 ms 31584 KB Output is correct
26 Correct 56 ms 31656 KB Output is correct
27 Correct 62 ms 31448 KB Output is correct
28 Correct 38 ms 23884 KB Output is correct