oj.uz

Submission #158089

# Submission time Handle Problem Language Result Execution time Memory
158089 2019-10-14T17:50:46 Z solimm4sks Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 36 ms 16120 KB 
#include <bits/stdc++.h>
using namespace std;

int dp[2005][2005];
const int MOD = 1e9 + 7;

int main()
{
    int n, cs, cf;
    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){ ///must put this at beggining or end
                dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1]; ///(will link/wont link chain)
                dp[i][j] %= MOD;
            }else{
                dp[i][j] = (1LL * dp[i - 1][j + 1] * j) % MOD + (1LL * dp[i - 1][j - 1] * (j - (i > cs) - (i > cf))) % MOD; ///if i > cs I cant put it before cs, if i > cf then I cant put it after it
                dp[i][j] %= MOD;
            }
        }
    }

    cout << dp[n][1] << "\n";
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 3 ms 1300 KB Output is correct
13 Correct 3 ms 1272 KB Output is correct
14 Correct 3 ms 1272 KB Output is correct
15 Correct 3 ms 1272 KB Output is correct
16 Correct 3 ms 1272 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct
19 Correct 3 ms 1276 KB Output is correct
20 Correct 3 ms 1244 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 3 ms 1300 KB Output is correct
13 Correct 3 ms 1272 KB Output is correct
14 Correct 3 ms 1272 KB Output is correct
15 Correct 3 ms 1272 KB Output is correct
16 Correct 3 ms 1272 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct
19 Correct 3 ms 1276 KB Output is correct
20 Correct 3 ms 1244 KB Output is correct
21 Correct 7 ms 4600 KB Output is correct
22 Correct 8 ms 4984 KB Output is correct
23 Correct 9 ms 5600 KB Output is correct
24 Correct 36 ms 16068 KB Output is correct
25 Correct 36 ms 15992 KB Output is correct
26 Correct 36 ms 15972 KB Output is correct
27 Correct 36 ms 16120 KB Output is correct
28 Correct 23 ms 12156 KB Output is correct