oj.uz

Submission #932843

# Submission time Handle Problem Language Result Execution time Memory
932843 2024-02-24T10:05:55 Z Aiperiii Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 27 ms 31836 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
const int N=2005,mod=1e9+7;
int dp[N][N];
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,s,t;
    cin>>n>>s>>t;
    dp[0][0]=1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==s or i==t)dp[i][j]=dp[i-1][j]+dp[i-1][j-1]%mod;
            else{
                int x=0;
                if(i>s)x++;
                if(i>t)x++;
                dp[i][j]=dp[i-1][j+1]*j%mod;
                dp[i][j]+=dp[i-1][j-1]*(j-x)%mod;
            }
        }
    }

    cout<<dp[n][1]<<"\n";
}
/*

 */

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2548 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2548 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2548 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 4 ms 6236 KB Output is correct
22 Correct 5 ms 7004 KB Output is correct
23 Correct 6 ms 7772 KB Output is correct
24 Correct 16 ms 31832 KB Output is correct
25 Correct 21 ms 31836 KB Output is correct
26 Correct 22 ms 31788 KB Output is correct
27 Correct 27 ms 31572 KB Output is correct
28 Correct 11 ms 25220 KB Output is correct