結果

問題 No.1886 Sum of Slide Max
ユーザー gazellegazelle
提出日時 2022-03-25 22:32:48
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 312 ms / 2,000 ms
コード長 4,240 bytes
コンパイル時間 2,404 ms
コンパイル使用メモリ 198,972 KB
実行使用メモリ 38,016 KB
最終ジャッジ日時 2024-04-22 07:15:12
合計ジャッジ時間 5,904 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
35,200 KB
testcase_01 AC 44 ms
34,944 KB
testcase_02 AC 48 ms
35,072 KB
testcase_03 AC 11 ms
35,200 KB
testcase_04 AC 43 ms
35,072 KB
testcase_05 AC 296 ms
37,632 KB
testcase_06 AC 57 ms
35,072 KB
testcase_07 AC 238 ms
36,992 KB
testcase_08 AC 311 ms
37,888 KB
testcase_09 AC 312 ms
37,888 KB
testcase_10 AC 311 ms
37,888 KB
testcase_11 AC 310 ms
38,016 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define FOR(i, n, m) for (long long i = (n); i < (long long)(m); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 998244353;
constexpr ld eps = 1e-6;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
    REP(i, v.size()) {
        if (i) os << " ";
        os << v[i];
    }
    return os;
}

struct modint {
    long long n;

   public:
    modint(const long long n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while (m > 0) {
            if (m & 1) {
                r *= a;
            }
            a = (a * a);
            m /= 2;
        }
        return r;
    }
    modint &operator++() {
        *this += 1;
        return *this;
    }
    modint &operator--() {
        *this -= 1;
        return *this;
    }
    modint operator++(int) {
        modint ret = *this;
        *this += 1;
        return ret;
    }
    modint operator--(int) {
        modint ret = *this;
        *this -= 1;
        return ret;
    }
    modint operator~() const { return (this->pow(n, mod - 2)); }  // inverse
    friend bool operator==(const modint &lhs, const modint &rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint &lhs, const modint &rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint &lhs, const modint &rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint &lhs, const modint &rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint &lhs, const modint &rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint &lhs, const modint &rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint &lhs, const modint &rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint &lhs, const modint &rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint &lhs, const modint &rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint &lhs, const modint &rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint &lhs, const modint &rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream &operator>>(istream &is, modint m) {
    is >> m.n;
    return is;
}
ostream &operator<<(ostream &os, modint m) {
    os << m.n;
    return os;
}

using mi = modint;

long long mod_pow(__int128 a, __int128 n, __int128 m = mod) {
    __int128 ret = 1;
    __int128 tmp = a;
    while (n > 0) {
        if (n % 2) ret *= tmp;
        ret %= m;
        tmp = tmp * tmp;
        tmp %= m;
        n /= 2;
    }
    return ret % m;
}

constexpr int MAX_N = 2020202;
mi mod_fact[MAX_N + 1];
mi mod_fact_i[MAX_N + 1];
mi mod_comb(long long n, long long k) {
    static bool initialized = false;
    if (n < 0 || k < 0 || n < k) return 0;
    if (not initialized) {
        mod_fact[0] = 1;
        for (int i = 1; i <= MAX_N; ++i) {
            mod_fact[i] = i * mod_fact[i - 1];
        }
        mod_fact_i[MAX_N] = mod_pow(mod_fact[MAX_N].n, mod - 2);
        for (int i = MAX_N - 1; i >= 0; --i) {
            mod_fact_i[i] = mod_fact_i[i + 1] * (i + 1);
        }
        initialized = true;
    }
    return mod_fact[n] * mod_fact_i[n - k] * mod_fact_i[k];
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    vector<mi> fact(2 * n);
    fact[0] = fact[1] = 1;
    FOR(i, 1, 2 * n) fact[i] = i * fact[i - 1];

    for (int k = 1; k <= n; k++) {
        mi ans = fact[n] * (n - k + 1) * n;
        ans -= fact[n - k + 1] * fact[k] * mod_comb(n, k + 1);
        cout << ans << endl;
    }

    return 0;
}
0