結果
| 問題 | No.2905 Nabeatsu Integration |
| ユーザー |
 hitonanode
|
| 提出日時 | 2024-10-09 00:09:41 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 10,604 bytes |
| コンパイル時間 | 2,460 ms |
| コンパイル使用メモリ | 199,688 KB |
| 実行使用メモリ | 98,036 KB |
| 最終ジャッジ日時 | 2024-10-09 00:09:49 |
| 合計ジャッジ時間 | 7,586 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
10,496 KB |
| testcase_01 | AC | 2 ms
5,248 KB |
| testcase_02 | AC | 1 ms
5,248 KB |
| testcase_03 | AC | 5 ms
5,248 KB |
| testcase_04 | AC | 2 ms
5,248 KB |
| testcase_05 | AC | 4 ms
5,248 KB |
| testcase_06 | AC | 3 ms
5,248 KB |
| testcase_07 | AC | 4 ms
5,248 KB |
| testcase_08 | AC | 2 ms
5,248 KB |
| testcase_09 | AC | 3 ms
5,248 KB |
| testcase_10 | AC | 4 ms
5,248 KB |
| testcase_11 | AC | 3 ms
5,248 KB |
| testcase_12 | AC | 4 ms
5,248 KB |
| testcase_13 | AC | 2 ms
5,248 KB |
| testcase_14 | AC | 2 ms
5,248 KB |
| testcase_15 | AC | 4 ms
5,248 KB |
| testcase_16 | AC | 4 ms
5,248 KB |
| testcase_17 | AC | 2 ms
5,248 KB |
| testcase_18 | AC | 3 ms
5,248 KB |
| testcase_19 | AC | 3 ms
5,248 KB |
| testcase_20 | AC | 2 ms
5,248 KB |
| testcase_21 | AC | 3 ms
5,248 KB |
| testcase_22 | AC | 3 ms
5,248 KB |
| testcase_23 | TLE | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
| testcase_44 | -- | - |
| testcase_45 | -- | - |
| testcase_46 | -- | - |
| testcase_47 | -- | - |
| testcase_48 | -- | - |
| testcase_49 | -- | - |
| testcase_50 | -- | - |
| testcase_51 | -- | - |
| testcase_52 | -- | - |
| testcase_53 | -- | - |
| testcase_54 | -- | - |
| testcase_55 | -- | - |
| testcase_56 | -- | - |
| testcase_57 | -- | - |
| testcase_58 | -- | - |
| testcase_59 | -- | - |
| testcase_60 | -- | - |
| testcase_61 | -- | - |
| testcase_62 | -- | - |
| testcase_63 | -- | - |
| testcase_64 | -- | - |
| testcase_65 | -- | - |
| testcase_66 | -- | - |
| testcase_67 | -- | - |
| testcase_68 | -- | - |
| testcase_69 | -- | - |
| testcase_70 | -- | - |
| testcase_71 | -- | - |
| testcase_72 | -- | - |
ソースコード
#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
// Aho-Corasick algorithm
// Verify: <http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=5101653>
// <https://yukicoder.me/submissions/598606>
// Complexity:
// - add(): O(|keyword_i|)
// - build_aho_corasick(): O(\sum_i |keyword_i|)
// - match() : O(\sum_i |keyword_i| + |str|)
template <class T, int (*char2int)(char)> struct AhoCorasick {
bool built;
const int D;
std::vector<T> node;
AhoCorasick(int D_) : built(false), D(D_), node(1, D) {}
AhoCorasick operator=(const AhoCorasick &rhs) { return AhoCorasick(rhs.D); }
void enter_child(int n, int nn, int c) { node[n].setch(c, nn); }
std::vector<int> endpos;
int add(const std::string &keyword) { // Enter_in_tree() in [1]
built = false;
int n = 0;
for (const auto &cc : keyword) {
int c = char2int(cc), nn = node[n].Goto(c);
if (!nn) {
nn = node.size();
enter_child(n, nn, c), node.emplace_back(D);
}
n = nn;
}
return endpos.push_back(n), n;
}
void complete_failure(int n, int nn, int c) {
int m = node[n].fail, mm = node[m].Goto(c);
while (m and !mm) m = node[m].fail, mm = node[m].Goto(c);
node[nn].fail = mm;
}
std::vector<int> visorder; // BFS order of node ids
void build() { // Build_failure() in [1]
visorder.clear();
for (auto p : node[0]) {
if (p.second) visorder.push_back(p.second);
}
for (size_t p = 0; p < visorder.size(); p++) {
int n = visorder[p];
for (auto p : node[n]) {
int c = p.first, nn = p.second;
if (nn) visorder.push_back(nn), complete_failure(n, nn, c);
}
}
built = true;
}
int step(int now, int d) {
while (now and !node[now].Goto(d)) now = node[now].fail;
return node[now].Goto(d);
}
// Count occurences of each added keywords in `str`
std::vector<int> match(const std::string &str) {
if (!built) build();
std::vector<int> freq(node.size());
int now = 0;
for (const auto &c : str) freq[now = step(now, char2int(c))]++;
for (auto i = visorder.rbegin(); i != visorder.rend(); i++)
freq[node[*i].fail] += freq[*i];
std::vector<int> ret;
for (auto x : endpos) ret.push_back(freq[x]);
return ret;
}
};
struct TrieNodeV {
std::vector<int> ch; // 全 bit が行き先
int fail;
TrieNodeV(int D = 0) : ch(D), fail(0) {}
int Goto(int d) { return ch[d]; }
void setch(int d, int i) { ch[d] = i; }
struct iterator {
int i;
std::vector<int>::iterator iter;
iterator operator++() { return {++i, ++iter}; }
std::pair<int, int> operator*() { return std::make_pair(i, *iter); }
bool operator!=(const iterator &rhs) { return iter != rhs.iter; }
};
iterator begin() { return {0, ch.begin()}; }
iterator end() { return {int(ch.size()), ch.end()}; }
};
struct TrieNodeUM : std::unordered_map<int, int> {
int fail;
TrieNodeUM(int = 0) : fail(0) {}
int Goto(int d) { return count(d) ? (*this)[d] : 0; }
void setch(int d, int i) { (*this)[d] = i; }
};
int c2i0aA(char c) { return c - '0'; }
#include <atcoder/modint>
using mint = atcoder::modint998244353;
int main() {
string S;
cin >> S;
const int n = S.size();
AhoCorasick<TrieNodeV, c2i0aA> ac(10);
ac.add(S);
ac.build();
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);
// 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';
}