Submission #51058460

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    std::string t;
    Num n;
    is >> t >> n;

    std::map<std::string, Num> ss;
    const std::string emp;
    ss[emp] = 0;

    for(Num loop{0}; loop<n; ++loop) {
        auto next = ss;
        Num a;
        is >> a;

        for(Num i{0}; i<a; ++i) {
            std::string s;
            is >> s;

            for(const auto& [sv,k] : ss) {
                auto u = sv;
                u += s;

                if (u.size() > t.size()) {
                    continue;
                }

                if (t.find(u) != 0) {
                    continue;
                }

                const auto newc = k + 1;
                if (!next.contains(u)) {
                    next[u] = newc;
                } else {
                    const auto c = next[u];
                    if (c > newc) {
                        next[u] = newc;
                    }
                }
            }
        }

        std::swap(ss, next);
    }

    if (ss.contains(t)) {
        os << ss[t] << "\n";
    } else {
        os << "-1\n";
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result