#767940 (C++17) No.1964 sum = length

提出ソース

結果

問題	No.1964 sum = length
ユーザー	iiljj
提出日時	2022-06-03 21:51:01
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	956 ms / 2,000 ms
コード長	14,282 bytes
コンパイル時間	1,822 ms
コンパイル使用メモリ	149,068 KB
実行使用メモリ	9,336 KB
最終ジャッジ日時	2024-09-21 02:38:25
合計ジャッジ時間	21,923 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	10 ms 9,088 KB
testcase_01	AC	4 ms 5,376 KB
testcase_02	AC	83 ms 9,088 KB
testcase_03	AC	3 ms 5,376 KB
testcase_04	AC	10 ms 9,216 KB
testcase_05	AC	14 ms 9,216 KB
testcase_06	AC	20 ms 9,208 KB
testcase_07	AC	25 ms 9,088 KB
testcase_08	AC	29 ms 9,336 KB
testcase_09	AC	34 ms 9,088 KB
testcase_10	AC	39 ms 9,216 KB
testcase_11	AC	43 ms 9,088 KB
testcase_12	AC	205 ms 9,208 KB
testcase_13	AC	290 ms 9,216 KB
testcase_14	AC	403 ms 9,088 KB
testcase_15	AC	457 ms 9,216 KB
testcase_16	AC	79 ms 9,216 KB
testcase_17	AC	234 ms 9,216 KB
testcase_18	AC	257 ms 9,216 KB
testcase_19	AC	167 ms 9,216 KB
testcase_20	AC	185 ms 9,216 KB
testcase_21	AC	73 ms 9,088 KB
testcase_22	AC	924 ms 9,088 KB
testcase_23	AC	864 ms 9,088 KB
testcase_24	AC	633 ms 9,216 KB
testcase_25	AC	684 ms 9,216 KB
testcase_26	AC	908 ms 9,204 KB
testcase_27	AC	757 ms 9,216 KB
testcase_28	AC	672 ms 9,216 KB
testcase_29	AC	812 ms 9,216 KB
testcase_30	AC	696 ms 9,208 KB
testcase_31	AC	930 ms 9,216 KB
testcase_32	AC	501 ms 9,216 KB
testcase_33	AC	491 ms 9,088 KB
testcase_34	AC	863 ms 9,088 KB
testcase_35	AC	569 ms 9,216 KB
testcase_36	AC	713 ms 9,216 KB
testcase_37	AC	800 ms 9,216 KB
testcase_38	AC	940 ms 9,216 KB
testcase_39	AC	678 ms 9,088 KB
testcase_40	AC	698 ms 9,216 KB
testcase_41	AC	906 ms 9,216 KB
testcase_42	AC	956 ms 9,208 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
// constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<<<N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<<<0, true>(cout, a); }

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    assert((cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region mint */

// 自動で MOD を取る整数
struct mint {
    ll x;
    constexpr mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
    constexpr mint &operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    constexpr mint &operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    constexpr mint &operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    constexpr mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    constexpr mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    constexpr mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    // O(log(t))
    constexpr mint pow_rec(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1); // ⌊t/2⌋ 乗
        a *= a;               // ⌊t/2⌋*2 乗
        if (t & 1)            // ⌊t/2⌋*2 == t-1 のとき
            a *= *this;       // ⌊t/2⌋*2+1 乗 => t 乗
        return a;
    }

    constexpr mint pow(ll t) const {
        mint a(*this);
        mint res = 1;
        while (t) {
            if (t & 1) res *= a;
            t >>= 1, a *= a;
        }
        return res;
    }

    // for prime mod
    constexpr mint inv_prime() const {
        return pow(MOD - 2); // オイラーの定理から， x^(-1) ≡ x^(p-2)
    }
    constexpr mint inv() const {
        ll a = this->x, b = MOD, u = 1, v = 0, t = 0;
        mint res;
        while (b) {
            t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        if (u < 0) u += MOD;
        res = u;
        return res;
    }
    constexpr mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
    constexpr mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    constexpr bool operator==(const mint &a) const { return this->x == a.x; }
    constexpr bool operator==(const ll a) const { return this->x == a; }
    constexpr bool operator!=(const mint &a) const { return this->x != a.x; }
    constexpr bool operator!=(const ll a) const { return this->x != a; }

    mint operator+() const { return *this; }
    mint operator-() const { return *this * (-1); }

    // mint 入力
    friend istream &operator>>(istream &is, mint &x) {
        is >> x.x;
        return is;
    }

    // mint 出力
    friend ostream &operator<<(ostream &os, const mint x) {
        os << x.x;
        return os;
    }
};

/* #endregion */

/* #region Cumulative1D */

template <typename T> struct Cumulative1D {
    using F = function<T(T, T)>;

    int n;
    vc<T> cum;
    F add, subtract;
    Cumulative1D(const vc<T> &data, const int n, F add, F subtract) : n(n), cum(n), add(add), subtract(subtract) {
        REP(i, 0, n) {
            if (i == 0) {
                cum[i] = data[i];
            } else {
                cum[i] = add(cum[i - 1], data[i]);
            }
        }
    }
    Cumulative1D() = default;

    // 0-indexed 半開区間
    T query(const int l, const int r) const {
        assert(0 <= l && l < n);
        assert(0 < r && r <= n);
        T ret = cum[r - 1];
        if (l > 0) ret = subtract(ret, cum[l - 1]);
        return ret;
    }
};

template <typename T> struct Cum {
    Cumulative1D<T> cum;

    Cum(const vc<T> &data, const int n) { // : cum(data, n, Cum::add, Cum::subtract)
        auto add = [](T a, T b) -> T { return a + b; };
        auto subtract = [](T a, T b) -> T { return a - b; };
        cum = Cumulative1D<T>(data, n, add, subtract);
    }
    Cum() = default;

    // 0-indexed 半開区間
    T query(const int l, const int r) const {
        if (l >= r) return 0;
        return cum.query(l, r);
    }
};

/* #endregion */

// Problem
void solve() {
    VAR(ll, n); //
    vc<vc<mint>> dp(500, vc<mint>(500, 0));
    // [1, 9]
    REP(i, 1, 10) {
        dp[1][i] += 1; //
    }
    // [10, 99]
    REP(i, 10, 100) {
        dp[2][i] += 1; //
    }
    // [100, 499]
    REP(i, 100, 500) {
        dp[3][i] += 1; //
    }

    REP(i, 1, n) {
        vc<Cum<mint>> cums(500);
        REP(j, 0, 500) {
            cums[j] = Cum<mint>(dp[j], 500); //
        }

        vc<vc<mint>> dp2(500, vc<mint>(500, 0));
        REP(j, 3, 500) REP(k, 2, 500) { // 長さ j, 和 k
            // 長さ 1 の数を追加する: dp[j-2][(k-9) .. (k-1)]
            if (0 <= j - 2 && j - 2 < 500) {
                ll l = max(0LL, k - 9);
                ll r = min(k, 500LL);
                if (l < r) dp2[j][k] += cums[j - 2].query(l, r);
            }

            // 長さ 2 の数を追加する: dp[j-3][(k-99) .. (k-10)]
            if (0 <= j - 3 && j - 3 < 500) {
                ll l = max(0LL, k - 99);
                ll r = min(k - 9, 500LL);
                if (l < r) dp2[j][k] += cums[j - 3].query(l, r);
            }

            // 長さ 3 の数を追加する: dp[j-4][(k-500) .. (k-100)]
            if (0 <= j - 4 && j - 4 < 500) {
                ll l = max(0LL, k - 500);
                ll r = min(k - 99, 500LL);
                if (l < r) dp2[j][k] += cums[j - 4].query(l, r);
            }
        }
        swap(dp, dp2);
    }

    mint ans = 0;
    REP(j, 1, 500) ans += dp[j][j];
    pprint(ans);
}

// entry point
int main() {
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード