답안 #1004070

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1004070	2024-06-21T04:17:38 Z	ef10	캥거루 (CEOI16_kangaroo)	C++17	100 / 100	29 ms	31900 KB

kangaroo

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define MODULE 1000000007

int main() {
	std::ifstream input;
    input.open("kangaroo.in");
    std::ofstream output;
    output.open("kangaroo.out");
	LL N, s, f;
	cin >> N >> s >> f;
	LL dp[N+5][N+5]; memset(dp,0,sizeof(dp));
	dp[1][1] = 1;
	for (LL i = 2; i <= N; i++) {
		for (LL j = 1; j <= i; j++) {
			if (i == s || i == f) {
				dp[i][j] += dp[i-1][j-1];
				dp[i][j] %= MODULE;
				dp[i][j] += dp[i-1][j];
				dp[i][j] %= MODULE;
				continue;
			}
			if (j-(i>s)-(i>f) > 0) {
				dp[i][j] += (dp[i-1][j-1] * (j-(i>s)-(i>f))) % MODULE;
				dp[i][j] %= MODULE;
			}
			dp[i][j] += (dp[i-1][j+1]*j) % MODULE;
			dp[i][j] %= MODULE;
		}
	}
	cout << dp[N][1] << endl;
}

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	0 ms	600 KB	Output is correct
14	Correct	0 ms	604 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	0 ms	600 KB	Output is correct
17	Correct	0 ms	604 KB	Output is correct
18	Correct	0 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	0 ms	604 KB	Output is correct

Subtask #4

49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	0 ms	600 KB	Output is correct
14	Correct	0 ms	604 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	0 ms	600 KB	Output is correct
17	Correct	0 ms	604 KB	Output is correct
18	Correct	0 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	0 ms	604 KB	Output is correct
21	Correct	3 ms	3872 KB	Output is correct
22	Correct	3 ms	4188 KB	Output is correct
23	Correct	3 ms	4956 KB	Output is correct
24	Correct	26 ms	31900 KB	Output is correct
25	Correct	26 ms	31900 KB	Output is correct
26	Correct	27 ms	31836 KB	Output is correct
27	Correct	29 ms	31580 KB	Output is correct
28	Correct	14 ms	18012 KB	Output is correct