結果
問題 | No.1845 Long Substrings |
ユーザー | sten_san |
提出日時 | 2022-02-18 23:19:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 35 ms / 2,000 ms |
コード長 | 3,258 bytes |
コンパイル時間 | 2,038 ms |
コンパイル使用メモリ | 205,320 KB |
実行使用メモリ | 5,208 KB |
最終ジャッジ日時 | 2023-09-11 20:07:48 |
合計ジャッジ時間 | 4,116 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
5,020 KB |
testcase_01 | AC | 22 ms
5,072 KB |
testcase_02 | AC | 33 ms
4,964 KB |
testcase_03 | AC | 35 ms
4,992 KB |
testcase_04 | AC | 24 ms
5,024 KB |
testcase_05 | AC | 28 ms
4,616 KB |
testcase_06 | AC | 32 ms
4,964 KB |
testcase_07 | AC | 23 ms
5,036 KB |
testcase_08 | AC | 33 ms
4,684 KB |
testcase_09 | AC | 34 ms
5,060 KB |
testcase_10 | AC | 20 ms
5,208 KB |
testcase_11 | AC | 30 ms
4,904 KB |
testcase_12 | AC | 32 ms
4,760 KB |
testcase_13 | AC | 23 ms
4,964 KB |
testcase_14 | AC | 34 ms
4,824 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 2 ms
4,380 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 3 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 2 ms
4,376 KB |
testcase_23 | AC | 1 ms
4,376 KB |
testcase_24 | AC | 2 ms
4,376 KB |
testcase_25 | AC | 1 ms
4,380 KB |
testcase_26 | AC | 2 ms
4,384 KB |
testcase_27 | AC | 2 ms
4,376 KB |
testcase_28 | AC | 2 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,380 KB |
testcase_30 | AC | 1 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,376 KB |
testcase_32 | AC | 2 ms
4,380 KB |
testcase_33 | AC | 1 ms
4,380 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename Container> auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector<int> i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template <typename, template <typename> typename, typename = void_t<>> struct detect : false_type {}; template <typename T, template <typename> typename Check> struct detect<T, Check, void_t<Check<T>>> : true_type {}; template <typename T, template <typename> typename Check> constexpr inline bool detect_v = detect<T, Check>::value; template <typename T> using has_member_sort = decltype(declval<T>().sort()); template <typename Container, typename Compare = less<typename Container::value_type>> auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v<Container, has_member_sort>) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template <typename Container, typename Compare = equal_to<typename Container::value_type>> auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } #include <atcoder/modint> using mint = atcoder::modint1000000007; int main() { constexpr int alpha = 'z' - 'a' + 1; auto ctoi = [](char c) -> int { return c - 'a'; }; int n; cin >> n; auto a = vec<int>(uns, n); for (auto &e : a) cin >> e; string s; cin >> s; auto dp = vec<mint>(uns, n + 1); dp[0] = 1; array<int, alpha> last = {}; fill(begin(last), end(last), -1); for (int i = 1; i <= n; ++i) { mint other = dp[0]; for (int j = 0; j < alpha; ++j) { if (last[j] < 0 || j == ctoi(s[i - 1])) { continue; } other += dp[last[j]]; } dp[i] = other; if (0 <= last[ctoi(s[i - 1])]) { dp[i] += dp[last[ctoi(s[i - 1])]]; } dp[i] += (a[i - 1] - 1) * other; last[ctoi(s[i - 1])] = i; } mint ans = 0; for (auto v : last) { if (0 <= v) { ans += dp[v]; } } cout << ans.val() << endl; }