oj.uz

Submission #861683

# Submission time Handle Problem Language Result Execution time Memory
861683 2023-10-16T16:25:59 Z Hydrolyzed Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 12 ms 31832 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const int MxN = 2020;
const ll MOD = 1e9 + 7;

ll dp[MxN][MxN]; // dp(i, j) = 1 to i with j components

signed main() {
	cin.tie(nullptr)->ios::sync_with_stdio(false);
	int n, stp, edp;
	cin >> n >> stp >> edp;
	dp[1][1] = 1ll;
	for(int i=2; i<=n; ++i) {
		for(ll j=1; j<=(ll) i; ++j) {
			if(i == stp || i == edp) {
				dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % MOD;
			}
			else {
				ll r = j;
				if(i > stp) {
					r -= 1ll;
				}
				if(i > edp) {
					r -= 1ll;
				}
				dp[i][j] = (dp[i - 1][j - 1] * r) % MOD;
				dp[i][j] = (dp[i][j] + (dp[i - 1][j + 1] * j)) % MOD; 
			}
		}
	}
	cout << dp[n][1] << "\n";	
	return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4564 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4564 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 3 ms 12636 KB Output is correct
23 Correct 3 ms 12752 KB Output is correct
24 Correct 11 ms 31776 KB Output is correct
25 Correct 12 ms 31768 KB Output is correct
26 Correct 11 ms 31832 KB Output is correct
27 Correct 11 ms 31580 KB Output is correct
28 Correct 7 ms 25136 KB Output is correct