結果
問題 | No.1702 count good string |
ユーザー |
![]() |
提出日時 | 2023-02-27 11:44:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 94 ms / 2,000 ms |
コード長 | 3,547 bytes |
コンパイル時間 | 1,705 ms |
コンパイル使用メモリ | 199,132 KB |
最終ジャッジ日時 | 2025-02-10 23:54:30 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 47 |
ソースコード
#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); }template <typename F>constexpr auto fix(F &&f) noexcept {return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);};}#include <atcoder/modint>using mint = atcoder::modint1000000007;int main() {constexpr string_view u = "yukicoder";constexpr auto set = [&]() {array<array<char, size(u)>, size(u) + 1> set = {};for (size_t i = 0; i < size(u); ++i) {set[0][i] = u[i];}for (size_t i = 1; i < size(set); ++i) {for (size_t j = 0; j < size(u); ++j) {set[i][j] = u[j];}set[i][i - 1] = '?';}return set;}();int n; cin >> n;string s; cin >> s;mint ans = 0;for (auto t : set) {auto dp = vec<mint>(0, n + 1, size(t) + 1);dp[0][0] = 1;for (int i = 1; i <= n; ++i) {dp[i][0] = dp[i - 1][0];for (size_t j = 1; j <= size(t); ++j) {dp[i][j] = dp[i - 1][j];if (s[i - 1] == t[j - 1]) {dp[i][j] += dp[i - 1][j - 1];}}}ans += dp[n][size(t)];}cout << ans.val() << endl;}