#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e3+5;
const long long MOD = 1e9+7;
long long dp[MAXN][MAXN];
int n,a,b;
int main(){
cin>>n>>a>>b;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==1 && j==1){
dp[i][j] = 1;
continue;
}
if(i==a||i==b){
dp[i][j] = dp[i-1][j-1]+dp[i-1][j];
dp[i][j]%=MOD;
}else{
dp[i][j] = dp[i-1][j+1]*j;
dp[i][j]%=MOD;
dp[i][j]+=dp[i-1][j-1]*(j-(i>a)-(i>b));
dp[i][j]%=MOD;
}
}
}
cout<<dp[n][1]<<endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
512 KB |
Output is correct |
5 |
Correct |
5 ms |
512 KB |
Output is correct |
6 |
Correct |
5 ms |
512 KB |
Output is correct |
7 |
Correct |
5 ms |
512 KB |
Output is correct |
8 |
Correct |
5 ms |
512 KB |
Output is correct |
9 |
Correct |
5 ms |
512 KB |
Output is correct |
10 |
Correct |
4 ms |
512 KB |
Output is correct |
11 |
Correct |
5 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
512 KB |
Output is correct |
5 |
Correct |
5 ms |
512 KB |
Output is correct |
6 |
Correct |
5 ms |
512 KB |
Output is correct |
7 |
Correct |
5 ms |
512 KB |
Output is correct |
8 |
Correct |
5 ms |
512 KB |
Output is correct |
9 |
Correct |
5 ms |
512 KB |
Output is correct |
10 |
Correct |
4 ms |
512 KB |
Output is correct |
11 |
Correct |
5 ms |
512 KB |
Output is correct |
12 |
Correct |
5 ms |
1408 KB |
Output is correct |
13 |
Correct |
6 ms |
1408 KB |
Output is correct |
14 |
Correct |
5 ms |
1408 KB |
Output is correct |
15 |
Correct |
6 ms |
1408 KB |
Output is correct |
16 |
Correct |
5 ms |
1536 KB |
Output is correct |
17 |
Correct |
5 ms |
1408 KB |
Output is correct |
18 |
Correct |
5 ms |
1280 KB |
Output is correct |
19 |
Correct |
5 ms |
1408 KB |
Output is correct |
20 |
Correct |
5 ms |
1408 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
512 KB |
Output is correct |
5 |
Correct |
5 ms |
512 KB |
Output is correct |
6 |
Correct |
5 ms |
512 KB |
Output is correct |
7 |
Correct |
5 ms |
512 KB |
Output is correct |
8 |
Correct |
5 ms |
512 KB |
Output is correct |
9 |
Correct |
5 ms |
512 KB |
Output is correct |
10 |
Correct |
4 ms |
512 KB |
Output is correct |
11 |
Correct |
5 ms |
512 KB |
Output is correct |
12 |
Correct |
5 ms |
1408 KB |
Output is correct |
13 |
Correct |
6 ms |
1408 KB |
Output is correct |
14 |
Correct |
5 ms |
1408 KB |
Output is correct |
15 |
Correct |
6 ms |
1408 KB |
Output is correct |
16 |
Correct |
5 ms |
1536 KB |
Output is correct |
17 |
Correct |
5 ms |
1408 KB |
Output is correct |
18 |
Correct |
5 ms |
1280 KB |
Output is correct |
19 |
Correct |
5 ms |
1408 KB |
Output is correct |
20 |
Correct |
5 ms |
1408 KB |
Output is correct |
21 |
Correct |
9 ms |
6400 KB |
Output is correct |
22 |
Correct |
10 ms |
7040 KB |
Output is correct |
23 |
Correct |
10 ms |
7808 KB |
Output is correct |
24 |
Correct |
38 ms |
39672 KB |
Output is correct |
25 |
Correct |
38 ms |
39672 KB |
Output is correct |
26 |
Correct |
37 ms |
39680 KB |
Output is correct |
27 |
Correct |
38 ms |
39416 KB |
Output is correct |
28 |
Correct |
26 ms |
23928 KB |
Output is correct |