oj.uz

답안 #488126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488126 2021-11-17T22:21:50 Z DrearyJoke 캥거루 (CEOI16_kangaroo) C++17
100 / 100
 30 ms 31692 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define END "\n"
#define rall(v) (v).rbegin(), (v).rend()
#define all(v) (v).begin(), (v).end()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

constexpr ll modu = 1e9 + 7;

void solve(){
    int n, a, b;
    cin >> n >> a >> b;
    if (a > b) swap(a, b);
    vector<vector<ll>> dp(n + 1, vector<ll>(n + 2));
    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (i == a || i == b) dp[i][j] += dp[i - 1][j - 1] + dp[i - 1][j];
            else {
                if (i < a && i < b) {
                    dp[i][j] += (j * (dp[i - 1][j + 1] + dp[i - 1][j - 1]));
                } else if (i > a && i < b) {
                    dp[i][j] += (j - 1) * (dp[i - 1][j + 1] + dp[i - 1][j - 1]) + dp[i - 1][j + 1];
                } else {
                    dp[i][j] += (j - 2) * (dp[i - 1][j + 1] + dp[i - 1][j - 1]) + 2 * dp[i - 1][j + 1];
                }
            }
            dp[i][j] %= modu;
        }
    }
    cout << dp[n][1] << END;
}
int main()
{
    fastio
    int t = 1;
    // cin>> t;
    while(t--) solve();
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 0 ms 572 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 0 ms 592 KB Output is correct
17 Correct 0 ms 592 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 564 KB Output is correct
20 Correct 1 ms 592 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 0 ms 572 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 0 ms 592 KB Output is correct
17 Correct 0 ms 592 KB Output is correct
18 Correct 0 ms 464 KB Output is correct
19 Correct 1 ms 564 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 3 ms 3664 KB Output is correct
22 Correct 3 ms 4176 KB Output is correct
23 Correct 4 ms 4816 KB Output is correct
24 Correct 23 ms 31680 KB Output is correct
25 Correct 22 ms 31652 KB Output is correct
26 Correct 30 ms 31692 KB Output is correct
27 Correct 22 ms 31340 KB Output is correct
28 Correct 13 ms 17916 KB Output is correct