Submission #495325

# Submission time Handle Problem Language Result Execution time Memory
495325 2021-12-18T12:41:36 Z VladM Kangaroo (CEOI16_kangaroo) C++14
6 / 100
1 ms 464 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;
    dp[0][0]=1;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; 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;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Incorrect 0 ms 464 KB Output isn't correct
8 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Incorrect 0 ms 464 KB Output isn't correct
8 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Incorrect 0 ms 464 KB Output isn't correct
8 Halted 0 ms 0 KB -