oj.uz

Submission #1004068

# Submission time Handle Problem Language Result Execution time Memory
1004068 2024-06-21T04:14:25 Z ef10 Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 50 ms 31836 KB 
// 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 ep = 0;
	LL dp[N+5][N+5]; memset(dp,0,sizeof(dp));
	dp[1][1] = 1;
	if (s==1 || f==1) {
		ep++;
	}
	for (LL i = 2; i <= N; i++) {
		for (LL j = 1; j <= N; j++) {
			if (i == s || i == f) {
				if (j == 1) ep++;
				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-ep > 0) {
				dp[i][j] += (dp[i-1][j-1] * (j-ep)) % 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 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 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 696 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 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 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 696 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 6 ms 3676 KB Output is correct
22 Correct 5 ms 4184 KB Output is correct
23 Correct 6 ms 4956 KB Output is correct
24 Correct 35 ms 31836 KB Output is correct
25 Correct 36 ms 31832 KB Output is correct
26 Correct 41 ms 31836 KB Output is correct
27 Correct 50 ms 31580 KB Output is correct
28 Correct 27 ms 18100 KB Output is correct