oj.uz

Submission #125444

# Submission time Handle Problem Language Result Execution time Memory
125444 2019-07-05T10:19:57 Z win11905 Kangaroo (CEOI16_kangaroo) C++11
100 / 100
 93 ms 31992 KB 
#include <bits/stdc++.h>
#define long long long
using namespace std;

const int M = 1e9+7;

const int N = 2e3+5;

int n, s, t;
long dp[N][N];

long solve(int i, int j) {
    if(j == 0) return 0;
    long &now = dp[i][j];
    if(now != -1) return now;
    if(i == 1) return now = (j == 1 ? 1 : 0);
    if(i == s || i == t) 
        return now = (solve(i-1, j-1) + solve(i-1, j)) % M;
    return now = (solve(i-1, j+1) * j + solve(i-1, j-1) * (j - (i > s ? 1 : 0) - (i > t ? 1 : 0))) % M; 
}

int main() {
    memset(dp, -1, sizeof dp);
    scanf("%d %d %d", &n, &s, &t);
    printf("%lld\n", solve(n, 1));
}

Compilation message

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31864 KB Output is correct
2 Correct 28 ms 31736 KB Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31864 KB Output is correct
2 Correct 28 ms 31736 KB Output is correct
3 Correct 28 ms 31864 KB Output is correct
4 Correct 28 ms 31736 KB Output is correct
5 Correct 27 ms 31864 KB Output is correct
6 Correct 28 ms 31864 KB Output is correct
7 Correct 27 ms 31864 KB Output is correct
8 Correct 28 ms 31864 KB Output is correct
9 Correct 28 ms 31864 KB Output is correct
10 Correct 28 ms 31864 KB Output is correct
11 Correct 28 ms 31864 KB Output is correct
12 Correct 28 ms 31864 KB Output is correct
13 Correct 29 ms 31864 KB Output is correct
14 Correct 28 ms 31864 KB Output is correct
15 Correct 29 ms 31992 KB Output is correct
16 Correct 29 ms 31868 KB Output is correct
17 Correct 28 ms 31836 KB Output is correct
18 Correct 28 ms 31864 KB Output is correct
19 Correct 29 ms 31808 KB Output is correct
20 Correct 29 ms 31864 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31864 KB Output is correct
2 Correct 28 ms 31736 KB Output is correct
3 Correct 28 ms 31864 KB Output is correct
4 Correct 28 ms 31736 KB Output is correct
5 Correct 27 ms 31864 KB Output is correct
6 Correct 28 ms 31864 KB Output is correct
7 Correct 27 ms 31864 KB Output is correct
8 Correct 28 ms 31864 KB Output is correct
9 Correct 28 ms 31864 KB Output is correct
10 Correct 28 ms 31864 KB Output is correct
11 Correct 28 ms 31864 KB Output is correct
12 Correct 28 ms 31864 KB Output is correct
13 Correct 29 ms 31864 KB Output is correct
14 Correct 28 ms 31864 KB Output is correct
15 Correct 29 ms 31992 KB Output is correct
16 Correct 29 ms 31868 KB Output is correct
17 Correct 28 ms 31836 KB Output is correct
18 Correct 28 ms 31864 KB Output is correct
19 Correct 29 ms 31808 KB Output is correct
20 Correct 29 ms 31864 KB Output is correct
21 Correct 34 ms 31864 KB Output is correct
22 Correct 35 ms 31836 KB Output is correct
23 Correct 37 ms 31864 KB Output is correct
24 Correct 92 ms 31992 KB Output is correct
25 Correct 93 ms 31992 KB Output is correct
26 Correct 89 ms 31992 KB Output is correct
27 Correct 77 ms 31932 KB Output is correct
28 Correct 56 ms 31992 KB Output is correct