Submission #442635

# Submission time Handle Problem Language Result Execution time Memory
442635 2021-07-08T11:38:15 Z parsabahrami Kangaroo (CEOI16_kangaroo) C++17
100 / 100
39 ms 15976 KB
/* I do it for the glory */
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 2e3 + 10, MOD = 1e9 + 7;
int n, s, e, dp[N][N];

int main() {
    scanf("%d%d%d", &n, &s, &e);
    dp[1][1] = 1;
    for (int i = 2; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == s || i == e) dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % MOD;
            else {
                int x = j;
                if (i > s) x--; 
                if (i > e) x--;
                dp[i][j] = (1ll * dp[i - 1][j + 1] * j % MOD + dp[i - 1][j - 1] * 1ll * x % MOD) % MOD;
            }
        }
    }
    printf("%d\n", dp[n][1]);
    return 0;
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%d%d%d", &n, &s, &e);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 432 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 432 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1204 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 1 ms 1068 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 1 ms 1228 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 432 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1204 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 1 ms 1068 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 1 ms 1228 KB Output is correct
21 Correct 6 ms 4556 KB Output is correct
22 Correct 6 ms 4924 KB Output is correct
23 Correct 7 ms 5452 KB Output is correct
24 Correct 36 ms 15976 KB Output is correct
25 Correct 36 ms 15940 KB Output is correct
26 Correct 38 ms 15940 KB Output is correct
27 Correct 39 ms 15940 KB Output is correct
28 Correct 22 ms 12092 KB Output is correct