#1016282 (C++23) No.2905 Nabeatsu Integration

提出ソース

結果

問題	No.2905 Nabeatsu Integration
ユーザー	hitonanode
提出日時	2024-10-09 00:21:11
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	141 ms / 2,000 ms
コード長	8,344 bytes
コンパイル時間	1,828 ms
コンパイル使用メモリ	190,832 KB
実行使用メモリ	51,236 KB
最終ジャッジ日時	2024-10-09 00:21:23
合計ジャッジ時間	9,797 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	1 ms 5,248 KB
testcase_02	AC	1 ms 5,248 KB
testcase_03	AC	3 ms 5,248 KB
testcase_04	AC	2 ms 5,248 KB
testcase_05	AC	2 ms 5,248 KB
testcase_06	AC	2 ms 5,248 KB
testcase_07	AC	2 ms 5,248 KB
testcase_08	AC	3 ms 5,248 KB
testcase_09	AC	2 ms 5,248 KB
testcase_10	AC	2 ms 5,248 KB
testcase_11	AC	2 ms 5,248 KB
testcase_12	AC	3 ms 5,248 KB
testcase_13	AC	2 ms 5,248 KB
testcase_14	AC	2 ms 5,248 KB
testcase_15	AC	2 ms 5,248 KB
testcase_16	AC	2 ms 5,248 KB
testcase_17	AC	2 ms 5,248 KB
testcase_18	AC	2 ms 5,248 KB
testcase_19	AC	2 ms 5,248 KB
testcase_20	AC	2 ms 5,248 KB
testcase_21	AC	2 ms 5,248 KB
testcase_22	AC	2 ms 5,248 KB
testcase_23	AC	109 ms 51,192 KB
testcase_24	AC	120 ms 51,064 KB
testcase_25	AC	112 ms 51,196 KB
testcase_26	AC	119 ms 51,104 KB
testcase_27	AC	122 ms 51,108 KB
testcase_28	AC	109 ms 51,236 KB
testcase_29	AC	107 ms 51,064 KB
testcase_30	AC	120 ms 51,192 KB
testcase_31	AC	141 ms 51,104 KB
testcase_32	AC	110 ms 51,192 KB
testcase_33	AC	110 ms 51,064 KB
testcase_34	AC	123 ms 51,192 KB
testcase_35	AC	111 ms 51,104 KB
testcase_36	AC	122 ms 51,064 KB
testcase_37	AC	123 ms 51,192 KB
testcase_38	AC	111 ms 51,068 KB
testcase_39	AC	123 ms 51,108 KB
testcase_40	AC	133 ms 51,076 KB
testcase_41	AC	108 ms 51,192 KB
testcase_42	AC	118 ms 51,108 KB
testcase_43	AC	125 ms 51,064 KB
testcase_44	AC	124 ms 51,196 KB
testcase_45	AC	125 ms 51,108 KB
testcase_46	AC	127 ms 51,108 KB
testcase_47	AC	130 ms 51,188 KB
testcase_48	AC	115 ms 51,104 KB
testcase_49	AC	133 ms 51,124 KB
testcase_50	AC	118 ms 51,100 KB
testcase_51	AC	117 ms 51,064 KB
testcase_52	AC	119 ms 51,108 KB
testcase_53	AC	115 ms 51,144 KB
testcase_54	AC	116 ms 51,060 KB
testcase_55	AC	112 ms 51,064 KB
testcase_56	AC	113 ms 51,064 KB
testcase_57	AC	118 ms 51,108 KB
testcase_58	AC	112 ms 51,108 KB
testcase_59	AC	131 ms 50,920 KB
testcase_60	AC	109 ms 51,192 KB
testcase_61	AC	89 ms 41,364 KB
testcase_62	AC	124 ms 51,108 KB
testcase_63	AC	126 ms 51,196 KB
testcase_64	AC	126 ms 51,104 KB
testcase_65	AC	109 ms 50,972 KB
testcase_66	AC	107 ms 51,064 KB
testcase_67	AC	109 ms 51,108 KB
testcase_68	AC	108 ms 51,068 KB
testcase_69	AC	122 ms 51,232 KB
testcase_70	AC	113 ms 51,056 KB
testcase_71	AC	113 ms 51,060 KB
testcase_72	AC	115 ms 51,060 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

// MP (Morris-Pratt) algorithm (length of longest nontrivial matching for
// prefix & suffix of s[0:i] for each i)
// Input: std::string of length N
// Output: std::vector<int> of size N + 1
// Complexity: O(N)
// Sample:
// - `teletelepathy` -> [-1, 0, 0, 0, 0, 1, 2, 3, 4, 0, 0, 1, 0, 0]
// Reference: <https://snuke.hatenablog.com/entry/2014/12/01/235807>
std::vector<int> mp_algorithm(std::string s) {
    int N = s.length();
    std::vector<int> ret(N + 1, -1);
    int j = -1;
    for (int i = 0; i < N; i++) {
        while (j >= 0 and s[i] != s[j]) j = ret[j];
        ret[i + 1] = ++j;
    }
    return ret;
}



#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    string S;
    cin >> S;
    const int n = S.size();

    constexpr int D = 10;

    // AhoCorasick<TrieNodeUM, c2i0aA> ac(D);
    auto mp = mp_algorithm(S);
    // ac.add(S);
    // ac.build();

    vector prv(D, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        // int p = ac.node.at(i).fail;
        int p = max(0, mp.at(i));
        dbg(make_tuple(i, p));
        for (int d = 0; d < D; ++d) {
            prv.at(d).at(i) = prv.at(d).at(p);
        }
        prv.at(S.at(i) - '0').at(i) = i + 1;
    }

    vector<mint> dp(n + 1);
    for (int i = 0; i < n; ++i) {
        mint sum = 0;
        for (int d = 0; d < 10; ++d) {
            // const int nxt = ac.step(i, d);
            const int nxt = prv.at(d).at(i);
            // dbg(make_tuple(i, d, nxt));
            if (nxt == i + 1) continue;
            sum += dp.at(i) - dp.at(nxt);
        }

        dp.at(i + 1) = dp.at(i) + 10 + sum;

        // e = 1 + 9/10 * (e + sum / 9)
        // e / 10 = 1 + sum / 10
    }

    cout << (dp.back() + 1 - n).val() << '\n';
}

yukicoder

結果

テストケース

ソースコード