oj.uz

Submission #484629

# Submission time Handle Problem Language Result Execution time Memory
484629 2021-11-04T21:11:13 Z NekoRolly Kangaroo (CEOI16_kangaroo) C++17
6 / 100
 1 ms 332 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;

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 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 0 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 0 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 0 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -