#990224 (C++23) No.2791 Beginner Contest

• 問題: No.2791 Beginner Contest
• ユーザー: 遭難者
• 提出日時: 2024-06-21 22:21:12
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 3 ms / 2,000 ms
• コード長: 2,507 bytes
• コンパイル時間: 7,684 ms
• コンパイル使用メモリ: 345,984 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-21 22:21:21
• 合計ジャッジ時間: 8,993 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 17

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast,unroll-loops")
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using mint = atcoder::modint998244353;
istream &operator>>(istream &is, mint &a)
{
    long t;
    is >> t;
    a = t;
    return is;
}
ostream &operator<<(ostream &os, mint a)
{
    return os << a.val();
}
#endif
typedef long double ldouble;
#undef long
#define long long long
#define overload3(a, b, c, name, ...) name
#define rep1(n) for (long i = 0; i < n; i++)
#define rep2(i, n) for (long i = 0; i < n; i++)
#define rep3(i, a, b) for (long i = a; i < b; i++)
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define per1(n) for (long i = n - 1; i >= 0; i--)
#define per2(i, n) for (long i = n - 1; i >= 0; i--)
#define per3(i, a, b) for (long i = b - 1; i >= (a); i--)
#define per(...) overload3(__VA_ARGS__, per3, per2, per1)(__VA_ARGS__)
#define ALL(a) a.begin(), a.end()
#define vec vector
template <typename T>
ostream &operator<<(ostream &os, vector<T> &a)
{
    const int n = a.size();
    rep(i, n)
    {
        os << a[i];
        if (i + 1 != n)
            os << " ";
    }
    return os;
}
template <typename T, size_t n>
ostream &operator<<(ostream &os, array<T, n> &a)
{
    rep(i, n)
    {
        os << a[i];
        if (i + 1 != n)
            os << " ";
    }
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &a)
{
    for (T &i : a)
        is >> i;
    return is;
}
template <typename T, typename S>
bool chmin(T &x, S y)
{
    if (x > (T)y)
    {
        x = (T)y;
        return true;
    }
    return false;
}
template <typename T, typename S>
bool chmax(T &x, S y)
{
    if (x < (T)y)
    {
        x = (T)y;
        return true;
    }
    return false;
}
template <typename T>
void operator++(vector<T> &a)
{
    for (T &i : a)
        ++i;
}
template <typename T>
void operator--(vector<T> &a)
{
    for (T &i : a)
        --i;
}
template <typename T>
void operator++(vector<T> &a, int)
{
    for (T &i : a)
        i++;
}
template <typename T>
void operator--(vector<T> &a, int)
{
    for (T &i : a)
        i--;
}
#undef endl
#define endl '\n'
void solve()
{
    int n, k;
    cin >> n >> k;
    vec<mint> d1(n + 1), d2(n + 1);
    d1[0] = 1;
    rep(i, n)
    {
        if (i + k <= n)
            d2[i + k] += d1[i];
        d2[i + 1] += d2[i];
        d1[i + 1] += d2[i + 1];
    }
    mint ans = 0;
    for (mint i : d1)
        ans += i;
    cout << ans << endl;
}
int main()
{
    // srand((unsigned)time(NULL));
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(40);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX