oj.uz

Submission #960643

# Submission time Handle Problem Language Result Execution time Memory
960643 2024-04-10T18:20:15 Z teo_thrash Kangaroo (CEOI16_kangaroo) C++14
6 / 100
 1 ms 2396 KB 
// it is your desire to work hard

#include<bits/stdc++.h>
#define pb push_back

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int maxn=2e3+3;
const int mod=1e9+7;

int n;
int dp[maxn][maxn];
int cs, cf;

int main(){

ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

cin>>n;
cin>>cs>>cf;

dp[1][1]=1;

for(int i=2; i<=n; i++){
    for(int j=1; j<=n; j++){
        int rem=0;
        if(i>cs) rem++;
        if(i>cf) rem++;

        if(i==cs or i==cf){
            dp[i][j] = (dp[i-1][j-1])%mod + (dp[i-1][j])%mod;
        }else{
            dp[i][j] = (dp[i-1][j+1]*j)%mod + (dp[i-1][j-1]*(j-rem))%mod;
        }
        dp[i][j]%=mod;
    }
}
cout<<dp[n][1]<<endl;

return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -