#935799 (C++17) No.2575 Almost Increasing Sequence

• 問題: No.2575 Almost Increasing Sequence
• ユーザー: siro53
• 提出日時: 2023-12-03 04:20:04
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 9,255 ms / 10,000 ms
• コード長: 7,546 bytes
• コンパイル時間: 2,520 ms
• コンパイル使用メモリ: 209,080 KB
• 実行使用メモリ: 6,676 KB
• スコア: 40,000
• 最終ジャッジ日時: 2023-12-03 04:23:21
• 合計ジャッジ時間: 197,027 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	9,157 ms; 6,676 KB
testcase_01	AC	9,158 ms; 6,676 KB
testcase_02	AC	9,191 ms; 6,676 KB
testcase_03	AC	9,174 ms; 6,676 KB
testcase_04	AC	9,164 ms; 6,676 KB
testcase_05	AC	9,171 ms; 6,676 KB
testcase_06	AC	9,198 ms; 6,676 KB
testcase_07	AC	9,163 ms; 6,676 KB
testcase_08	AC	9,156 ms; 6,676 KB
testcase_09	AC	9,162 ms; 6,676 KB
testcase_10	AC	9,201 ms; 6,676 KB
testcase_11	AC	9,159 ms; 6,676 KB
testcase_12	AC	9,208 ms; 6,676 KB
testcase_13	AC	9,187 ms; 6,676 KB
testcase_14	AC	9,186 ms; 6,676 KB
testcase_15	AC	9,194 ms; 6,676 KB
testcase_16	AC	9,192 ms; 6,676 KB
testcase_17	AC	9,166 ms; 6,676 KB
testcase_18	AC	9,206 ms; 6,676 KB
testcase_19	AC	9,255 ms; 6,676 KB

ソースコード

#line 1 "combined.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define REVERSE(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

#line 2 "/Users/siro53/kyo-pro/compro_library/modint/modint.hpp"

#line 6 "/Users/siro53/kyo-pro/compro_library/modint/modint.hpp"

template <int mod> class ModInt {
  public:
    ModInt() : x(0) {}
    ModInt(long long y)
        : x(y >= 0 ? y % umod() : (umod() - (-y) % umod()) % umod()) {}
    unsigned int val() const { return x; }
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= umod()) x -= umod();
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += umod() - p.x) >= umod()) x -= umod();
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (unsigned int)(1ULL * x * p.x % umod());
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inv();
        return *this;
    }
    ModInt operator-() const { return ModInt(-(long long)x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inv() const {
        long long a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            std::swap(a -= t * b, b);
            std::swap(u -= t * v, v);
        }
        return ModInt(u);
    }
    ModInt pow(unsigned long long n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
    friend std::ostream &operator<<(std::ostream &os, const ModInt &p) {
        return os << p.x;
    }
    friend std::istream &operator>>(std::istream &is, ModInt &a) {
        long long t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }
    static constexpr int get_mod() { return mod; }

  private:
    unsigned int x;
    static constexpr unsigned int umod() { return mod; }
};
#line 78 "combined.cpp"
using mint = ModInt<MOD2>;
#line 2 "/Users/siro53/kyo-pro/compro_library/math/binom.hpp"

#line 6 "/Users/siro53/kyo-pro/compro_library/math/binom.hpp"

template <class mint> class Binomial {
  public:
    explicit Binomial(): Binomial(1) {}
    explicit Binomial(int MAX) : f(MAX, mint(1)), f_inv(MAX, mint(1)) {
        for(int i = 1; i < MAX; i++) f[i] = f[i-1] * mint(i);
        f_inv[MAX - 1] = f[MAX - 1].inv();
        for(int i = MAX - 2; i >= 1; i--) {
            f_inv[i] = f_inv[i + 1] * mint(i + 1);
        } 
    }
    void extend() {
        int n = (int)f.size();
        f.resize(n * 2);
        f_inv.resize(n * 2);
        for(int i = n; i < n * 2; i++) f[i] = f[i - 1] * mint(i);
        f_inv[n * 2 - 1] = f[n * 2 - 1].inv();
        for(int i = n * 2 - 2; i >= n; i--) {
            f_inv[i] = f_inv[i + 1] * mint(i + 1);
        }
    }
    mint fac(int n) {
        if(n < 0) return mint(0);
        while(n >= (int)f.size()) extend();
        return f[n];
    }
    mint fac_inv(int n) {
        if(n < 0) return mint(0);
        while(n >= (int)f_inv.size()) extend();
        return f_inv[n];
    }
    mint inv(int n) {
        if(n < 0) return -mint(-n);
        assert(n != 0);
        while(n >= (int)f_inv.size()) extend();
        return (f_inv[n] * f[n - 1]);
    }
    mint binom(int n, int k) {
        if(n < k || n < 0 || k < 0) return mint(0);
        return (fac(n) * fac_inv(k) * fac_inv(n - k));
    }
    mint binom_naive(long long n, long long k) {
        if(n < k || n < 0 || k < 0) return mint(0);
        mint res(1);
        k = std::min(k, n - k);
        for(int i = 0; i < k; i++) res *= inv(i + 1) * mint(n - i);
        return res;
    }
    mint perm(int n, int k) {
        if(n < k || n < 0 || k < 0) return mint(0);
        return (fac(n) * fac_inv(n - k));
    }
    mint hom(int n, int k) {
        if(n < 0 || k < 0) return mint(0);
        return (k == 0 ? mint(1) : binom(n + k - 1, k));
    }

  private:
    std::vector<mint> f, f_inv;
};
#line 80 "combined.cpp"

void solve() {
    Binomial<mint> binom;
    int K;
    cin >> K;
    // https://codeforces.com/blog/entry/98167
    auto standard_tableau_count = [&](int l, int m, int n, int sum) -> mint {
        mint res = binom.fac(sum);
        res *= binom.fac_inv(n);
        res *= binom.fac_inv(m - n);
        res *= binom.fac_inv(l - m);
        res *= binom.fac_inv(m + 1) * binom.fac(m + 1 - n);
        res *= binom.fac_inv(l + 2) * binom.fac(l + 2 - n);
        res *= binom.fac_inv(l - n + 1) * binom.fac((l - n) - (m - n) + 1);
        return res;
    };
    const int N = 2000;
    cout << N << endl;
    vector<mint> powerK(N+1, 1);
    REP(i, 2, N+1) powerK[i] = mint(i).pow(K);
    REP(n, 1, N+1) {
        mint ans = 0;
        REP(i, 1, n+1) {
            mint sum = 0;
            REP(j, i+1) {
                int k = n - i - j;
                if(k < 1) continue;
                if(!(i >= j and j >= k)) continue;
                mint c = standard_tableau_count(i, j, k, n);
                sum += c * c;
            }
            ans += sum * powerK[i];
        }
        cout << ans << " \n"[n == N];
    }
}

int main() {
    int T{1};
    // cin >> T;
    while(T--) solve();
}