oj.uz

Submission #484630

# Submission time Handle Problem Language Result Execution time Memory
484630 2021-11-04T21:12:49 Z NekoRolly Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 11 ms 14132 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e3+4;
const ll inf = 2e18;
const int mod = 1e9+7;

int n,a,b;
int dp[N][N];

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

	cin >> n >> a >> b;

	dp[0][0] = 1;
	for (int i=1; i<=n; i++) for (ll j=1; j<=i; j++){
		if (i == a || i == b) dp[i][j] = (dp[i-1][j-1] + dp[i-1][j])%mod;
		else dp[i][j] = ((j - (i>a) - (i>b)) * dp[i-1][j-1] + j*dp[i-1][j+1])%mod;
	}

	cout << dp[n][1] << "\n";

	return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 0 ms 460 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1220 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1084 KB Output is correct
19 Correct 1 ms 1084 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1220 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1084 KB Output is correct
19 Correct 1 ms 1084 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 2 ms 3788 KB Output is correct
22 Correct 2 ms 4044 KB Output is correct
23 Correct 2 ms 4428 KB Output is correct
24 Correct 10 ms 14096 KB Output is correct
25 Correct 11 ms 14084 KB Output is correct
26 Correct 10 ms 14132 KB Output is correct
27 Correct 10 ms 14028 KB Output is correct
28 Correct 7 ms 10188 KB Output is correct