oj.uz

Submission #870073

# Submission time Handle Problem Language Result Execution time Memory
870073 2023-11-06T20:57:58 Z blackslex Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 16 ms 23132 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 2005, M = 1e9 + 7;
ll n, cs, cf, ed, dp[N][N];

int main() {
    scanf("%lld %lld %lld", &n, &cs, &cf);
    dp[1][1] = 1; ed += (cs == 1 || cf == 1);
    for (int i = 1; i < n; i++) {
        if (i + 1 == cs || i + 1 == cf) {
            for (int j = 1; j <= i; j++) {
                dp[i + 1][j + 1] += dp[i][j]; dp[i + 1][j + 1] %= M;
                dp[i + 1][j] += dp[i][j]; dp[i + 1][j] %= M;
            }
            ed++;
        } else {
            for (int j = 1; j <= i; j++) {
                dp[i + 1][j + 1] += (j + 1 - ed) * dp[i][j]; dp[i + 1][j + 1] %= M;
                dp[i + 1][j - 1] += (j - 1) * dp[i][j]; dp[i + 1][j - 1] %= M;
            }
        }
    }
    printf("%lld", dp[n][1]);
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%lld %lld %lld", &n, &cs, &cf);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 1 ms 1116 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 1368 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 1 ms 1116 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 1368 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 3 ms 4700 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 5464 KB Output is correct
24 Correct 16 ms 23132 KB Output is correct
25 Correct 15 ms 23076 KB Output is correct
26 Correct 15 ms 23132 KB Output is correct
27 Correct 16 ms 22780 KB Output is correct
28 Correct 10 ms 15196 KB Output is correct