답안 #924880

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
924880	2024-02-10T02:31:21 Z	Github	캥거루 (CEOI16_kangaroo)	C++17	100 / 100	22 ms	31888 KB

kangaroo

#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;

#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
const ll MOD = 1e9+7, MAXN = 5*1e6+5;



int main() {
    speedup
    int n, a, b; cin >> n >> a >> b;
    vector<vector<ll>> dp(n+1, vector<ll>(n+1));
    dp[1][1] = 1;
    for (int i = 2; i <= n; i++){
        for (int j = 1; j <= i; j++){
            if (i == a || i == b){
                dp[i][j] = (dp[i-1][j]+dp[i-1][j-1])%MOD;
            }else{
                dp[i][j] = (dp[i-1][j+1]*j+dp[i-1][j-1]*(max(j-(i>a)-(i>b), 0)))%MOD;
            }
        }
    }
    if (dp[n][1] < 0){
        dp[n][1] += MOD;
    }
    cout << dp[n][1] << endl;
    return 0;
}

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	456 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	456 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	604 KB	Output is correct
13	Correct	1 ms	600 KB	Output is correct
14	Correct	1 ms	608 KB	Output is correct
15	Correct	1 ms	612 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	608 KB	Output is correct

Subtask #4

49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	456 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	604 KB	Output is correct
13	Correct	1 ms	600 KB	Output is correct
14	Correct	1 ms	608 KB	Output is correct
15	Correct	1 ms	612 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	608 KB	Output is correct
21	Correct	3 ms	3672 KB	Output is correct
22	Correct	3 ms	4204 KB	Output is correct
23	Correct	3 ms	4956 KB	Output is correct
24	Correct	17 ms	31844 KB	Output is correct
25	Correct	17 ms	31888 KB	Output is correct
26	Correct	22 ms	31848 KB	Output is correct
27	Correct	18 ms	31584 KB	Output is correct
28	Correct	9 ms	18012 KB	Output is correct