oj.uz

Submission #385217

# Submission time Handle Problem Language Result Execution time Memory
385217 2021-04-03T17:19:34 Z pure_mem Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 22 ms 23020 KB 
#include <bits/stdc++.h> 
 
#define X first
#define Y second
#define MP make_pair
#define ll long long
 
using namespace std;
 
const int N = 2003;
const ll mod = 1e9 + 7, INF = 1e18; 

int n, cf, cs;
ll dp[N][N];

int main () {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> cs >> cf;
	if(cs > cf)
		swap(cf, cs);
	dp[n + 1][0] = 1;
	for(int i = n;i >= 1;i--){
		for(int j = 0;j <= n - i + 1;j++){	
			if(i > cf){
				dp[i][j] = ((j ? dp[i + 1][j - 1]: 0) + dp[i + 1][j + 1] * j * (j + 1)) % mod;
			}
			else if(i == cf){
				dp[i][j] = (dp[i + 1][j] + dp[i + 1][j + 1] * (j + 1)) % mod;
			}
			else if(cs < i){
				dp[i][j] = ((j ? dp[i + 1][j - 1]: 0) + dp[i + 1][j + 1] * (j + 1) * (j + 1)) % mod;	
			}
			else if(cs == i){
				dp[i][j] = (dp[i + 1][j] + dp[i + 1][j + 1] * (j + 1)) % mod;
			}
			else{
			    dp[i][j] = ((j ? dp[i + 1][j - 1]: 0) + dp[i + 1][j + 1] * (j + 2) * (j + 1)) % mod;	
			}
		}
	}
	cout << dp[2][0];
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 2 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 2 ms 1260 KB Output is correct
15 Correct 2 ms 1260 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 2 ms 1260 KB Output is correct
18 Correct 2 ms 1132 KB Output is correct
19 Correct 2 ms 1260 KB Output is correct
20 Correct 2 ms 1260 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 2 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 2 ms 1260 KB Output is correct
15 Correct 2 ms 1260 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 2 ms 1260 KB Output is correct
18 Correct 2 ms 1132 KB Output is correct
19 Correct 2 ms 1260 KB Output is correct
20 Correct 2 ms 1260 KB Output is correct
21 Correct 4 ms 4716 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 5 ms 5612 KB Output is correct
24 Correct 22 ms 23020 KB Output is correct
25 Correct 19 ms 23020 KB Output is correct
26 Correct 19 ms 23020 KB Output is correct
27 Correct 19 ms 22892 KB Output is correct
28 Correct 12 ms 15084 KB Output is correct