結果

問題 No.1086 桁和の桁和2
ユーザー kcvlex
提出日時 2020-06-19 23:32:00
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 119 ms / 3,000 ms
コード長 8,485 bytes
コンパイル時間 1,351 ms
コンパイル使用メモリ 153,692 KB
最終ジャッジ日時 2025-01-11 08:07:53
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif
// Yay!!
#define endl codeforces
// macros for iterator
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
// alias
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
// variadic min/max
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
// variadic chmin/chmax
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
// multi demension array
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail
    ...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;
#ifdef CPP17
// fill container
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable<F, Args...>::value) { t = f(args...); } else { for (ssize_t i = 0; i < t
    .size(); i++) fill_seq(t[i], f, args..., i); } }
#endif
// make multi dimension vector
template <typename T> vec<T> make_v(ssize_t sz) { return vec<T>(sz); }
template <typename T, typename... Tail> auto make_v(ssize_t hs, Tail&&... ts) { auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); return vec
    <decltype(v)>(hs, v); }
// init
namespace init__ { 
struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } 
    init_io; 
}
namespace math {
template <typename T>
constexpr T pow(const T &n, ll k) {
    T ret = n.mul_id_ele();
    T cur = n;
    while (k) {
        if (k & 1) ret *= cur;
        cur *= cur;
        k /= 2;
    }
    return ret;
}
}
namespace math {
template <ll Mod>
struct Modint {
    constexpr Modint(ll x) noexcept : x((Mod + x % Mod) % Mod) { }
    
    constexpr Modint() noexcept : Modint(0) { }
    
    constexpr Modint<Mod> add_id_ele() const noexcept { 
        return Modint<Mod>(0); 
    }
    
    constexpr Modint<Mod> mul_id_ele() const noexcept {
        return Modint<Mod>(1); 
    }
    
    constexpr ll& value() noexcept { 
        return x; 
    }
    
    constexpr ll value() const noexcept {
        return x; 
    }
    constexpr Modint& operator +=(const Modint &oth) noexcept {
        x += oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }
    constexpr Modint& operator -=(const Modint &oth) noexcept {
        x += Mod - oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }
    constexpr Modint& operator *=(const Modint &oth) noexcept {
        x *= oth.value();
        x %= Mod;
        return *this;
    }
    constexpr Modint& operator /=(const Modint &oth) noexcept {
        x *= oth.inv().value();
        x %= Mod;
        return *this;
    }
    constexpr Modint operator +(const Modint &oth) const noexcept {
        return Modint(x) += oth;
    }
    constexpr Modint operator -(const Modint &oth) const noexcept {
        return Modint(x) -= oth;
    }
    constexpr Modint operator *(const Modint &oth) const noexcept {
        return Modint(x) *= oth;
    }
    constexpr Modint operator /(const Modint &oth) const noexcept {
        return Modint(x) /= oth;
    }
    constexpr Modint operator -() const noexcept {
        return Modint((x != 0) * (Mod - x)); 
    }
    template <typename T>
    constexpr typename std::enable_if<std::is_integral<T>::value, const Modint&>::type
    operator =(T t) noexcept {
        (*this) = Modint(std::forward<T>(t)); 
        return *this;
    }
    constexpr Modint inv() const noexcept {
        return ::math::pow(*this, Mod - 2);
    }
    constexpr ll mod() const noexcept {
        return Mod;
    }
private:
    ll x;
};
}
namespace graph {
using Node = ll;
using Weight = ll;
using Edge = std::pair<Node, Weight>;
template <bool Directed>
struct Graph : public vvec<Edge> {
    using vvec<Edge>::vvec;
    void add_edge(Node f, Node t, Weight w = 1) {
        (*this)[f].emplace_back(t, w);
        if (!Directed) (*this)[t].emplace_back(f, w);
    }
    Graph<Directed> build_inv() const {
        Graph<Directed> ret(this->size());
        for (Node i = 0; i < this->size(); i++) {
            for (const Edge &e : (*this)[i]) {
                Node j;
                Weight w;
                std::tie(j, w) = e;
                if (!Directed && j < i) continue;
                ret.add_edge(j, i, w);
            }
        }
        return ret;
    }
};
template <typename Iterator>
class dst_iterator {
    Iterator ite;
public:
    dst_iterator(Iterator ite) : ite(ite) { }
    bool operator ==(const dst_iterator<Iterator> &oth) const {
        return ite == oth.ite;
    }
    bool operator !=(const dst_iterator<Iterator> &oth) const {
        return !(*this == oth);
    }
    bool operator <(const dst_iterator<Iterator> &oth) const {
        return ite < oth.ite;
    }
    bool operator >(const dst_iterator<Iterator> &oth) const {
        return ite > oth.ite;
    }
    bool operator <=(const dst_iterator<Iterator> &oth) const {
        return ite <= oth.ite;
    }
    bool operator >=(const dst_iterator<Iterator> &oth) const {
        return ite >= oth.ite;
    }
    const Node& operator *() {
        return ite->first;
    }
    const Node& operator *() const {
        return ite->first;
    }
    dst_iterator operator ++() {
        ++ite;
        return ite;
    }
};
class dst_iteration {
    using ite_type = vec<Edge>::const_iterator;
    const vec<Edge> &edges;
public:
    dst_iteration(const vec<Edge> &edges) : edges(edges) { }
    auto begin() const {
        return dst_iterator<ite_type>(edges.cbegin());
    }
    auto end() const {
        return dst_iterator<ite_type>(edges.cend());
    }
};
class dst_reverse_iteration {
    using ite_type = vec<Edge>::const_reverse_iterator;
    const vec<Edge> &edges;
public:
    dst_reverse_iteration(const vec<Edge> &edges) : edges(edges) { }
    auto begin() const {
        return dst_iterator<ite_type>(edges.crbegin());
    }
    auto end() const {
        return dst_iterator<ite_type>(edges.crend());
    }
};
dst_iteration dst(const vec<Edge> &edges) {
    return dst_iteration(edges);
}
dst_reverse_iteration rdst(const vec<Edge> &edges) {
    return dst_reverse_iteration(edges);
}
}
constexpr ll mod = 1e9 + 7;
using mint = math::Modint<mod>;
int main() {
    ll n;
    std::cin >> n;
    vec<ll> lv(n), rv(n), dv(n);
    for (ll &e : lv) std::cin >> e;
    for (ll &e : rv) std::cin >> e;
    for (ll &e : dv) std::cin >> e;
    ll pre = 0;
    mint ans = 1;
    auto inv9 = mint(9).inv();
    for (ll i = 0; i < n; i++) {
        ll l = lv[i], r = rv[i], d = dv[i];
        if (d == 0) {
            if (pre != 0) ans = 0;
        } else {
            mint cntl = (l == 0 ? mint(0) : pow(mint(10), l) - 1) * inv9;
            mint cntr = (pow(mint(10), r) - 1) * inv9;
            mint cnt = cntr - cntl;
            if (pre == d) cnt += 1;
            ans *= cnt;
        }
        pre = d;
    }
    std::cout << ans.value() << "\n";
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0