답안 #538370

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
538370	2022-03-16T16:51:56 Z	alextodoran	캥거루 (CEOI16_kangaroo)	C++17	100 / 100	27 ms	15948 KB

kangaroo

/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 2000;
const int MOD = (int) 1e9 + 7;

int N, L, R;

int dp[N_MAX + 2][N_MAX + 2];

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N >> L >> R;

    dp[0][1] = 1;
    for (int i = 1; i <= N; i++) {
        for (int open = 0; open <= N; open++) {
            if (i == L || i == R) {
                dp[i][open] += dp[i - 1][open];
                if (dp[i][open] >= MOD) {
                    dp[i][open] -= MOD;
                }
                dp[i][open - 1] += dp[i - 1][open];
                if (dp[i][open - 1] >= MOD) {
                    dp[i][open - 1] -= MOD;
                }
            } else {
                dp[i][open + 1] = (dp[i][open + 1] + (ll) dp[i - 1][open] * open) % MOD;
                dp[i][open - 1] = (dp[i][open - 1] + (ll) dp[i - 1][open] * max(0, open - (i < L) - (i < R))) % MOD;
            }
        }
    }

    cout << dp[N][0] << "\n";

    return 0;
}

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	584 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	456 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	584 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	456 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	1 ms	1224 KB	Output is correct
13	Correct	1 ms	1108 KB	Output is correct
14	Correct	1 ms	1236 KB	Output is correct
15	Correct	1 ms	1216 KB	Output is correct
16	Correct	1 ms	1236 KB	Output is correct
17	Correct	1 ms	1224 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1224 KB	Output is correct
20	Correct	1 ms	1236 KB	Output is correct

Subtask #4

49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	584 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	456 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	1 ms	1224 KB	Output is correct
13	Correct	1 ms	1108 KB	Output is correct
14	Correct	1 ms	1236 KB	Output is correct
15	Correct	1 ms	1216 KB	Output is correct
16	Correct	1 ms	1236 KB	Output is correct
17	Correct	1 ms	1224 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1224 KB	Output is correct
20	Correct	1 ms	1236 KB	Output is correct
21	Correct	6 ms	4652 KB	Output is correct
22	Correct	5 ms	4948 KB	Output is correct
23	Correct	6 ms	5572 KB	Output is correct
24	Correct	26 ms	15888 KB	Output is correct
25	Correct	25 ms	15920 KB	Output is correct
26	Correct	27 ms	15948 KB	Output is correct
27	Correct	26 ms	15828 KB	Output is correct
28	Correct	16 ms	11988 KB	Output is correct