oj.uz

Submission #311308

# Submission time Handle Problem Language Result Execution time Memory
311308 2020-10-09T22:35:35 Z jainbot27 Kangaroo (CEOI16_kangaroo) C++17
6 / 100
 1 ms 384 KB 
#include "iostream"
using namespace std;

const int64_t MOD = 1e9 + 7;
int64_t dp[2001][2001];

int main(){
    int n, a, b;
    cin >> n >> a >> b;
    dp[0][0] = 1;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++){
            if(i == a || i == b) 
                dp[i][j] = (dp[i-1][j] + dp[i-1][j-1]) % MOD;
            else 
                dp[i][j] = (dp[i-1][j+1] * j + dp[i-1][j-1] * (j - (i > a) - (i > b)));
        }
    cout << dp[n][1];
}

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 1 ms 384 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 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 1 ms 384 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 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -