#500579 (C++17) No.1086 桁和の桁和2

• 問題: No.1086 桁和の桁和2
• ユーザー: Konton7
• 提出日時: 2020-06-20 22:24:31
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 152 ms / 3,000 ms
• コード長: 5,832 bytes
• コンパイル時間: 2,063 ms
• コンパイル使用メモリ: 205,088 KB
• 最終ジャッジ日時: 2025-01-11 08:48:54
• ジャッジサーバーID （参考情報）: judge1 / judge1

ファイルパターン	結果
sample	AC * 5
other	AC * 31

ソースコード

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w)
{
    return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T>
vector<T> cumsum(const vector<T> &v)
{
    T s = 0;
    vector<T> ret;

    rep(i, v.size())
    {
        s += v[i];
        s %= mod;
        ret.emplace_back(s);
    }
    return ret;
}

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c)
{
    VS ret;
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            ret.emplace_back(part);
            part = "";
        }
        else if (s[i] != c)
        {
            part += s[i];
        }
    }
    return ret;
}

string removezero(string &s)
{
    string ret;
    for (auto z : s)
        if (z != '0')
            ret += z;
    return ret;
}

ll sumdigit(ll x)
{
    ll ans{0};
    while (x > 0)
    {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r;
        r = (r * r), q /= 2;
    }
    return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
    rep(i, frac_list.size() - 1)
    {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
    if (a < b)
        return 0;
    if (b < 0)
        return 0;
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

const ll inv_9 = pow_mod(9ll, mod - 2, mod);

int disitsum(int a)
{
    int ret = a % 9;
    if (a != 0 && ret == 0)
        ret = 9;
    return ret;
}

VI disitsum_move(int a, int b)
{
    VI ret;
    if (a == 0)
        ret.emplace_back(b);
    else if (a > 0 && a == b)
    {
        ret.emplace_back(9);
        ret.emplace_back(0);
    }
    else if (a > 0 && b > 0 && a < b)
    {
        ret.emplace_back(b - a);
    }
    else if (a > 0 && b > 0 && a > b)
    {
        ret.emplace_back(b + 9 - a);
    }
    return ret;
}

ll get_digitsum(VI v, ll l, ll r)
{
    if (v.empty())
    {
        return 0ll;
    }

    ll p, q, ret{0ll};
    if (v.size() == 2 || v[0] == 0)
    {
        ret++;
    }
    if (v[0] != 0)
    {
        if (l == 0)
        {
            ret++;
            l = 1;
        }
        p = 10 * pow_mod(10, l - 1, mod);
        p %= mod;
        q = pow_mod(10, r - l, mod) + (mod - 1);
        q *= inv_9;
        q %= mod;
        ret += (p * q);
        ret %= mod;
    }

    return ret;
}



int main()
{

    cin.tie(0);
    ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n;
    cin >> n;
    ll a, b, d, ans;
    VI v;
    VL l_list(n), r_list(n), d_list(n);

    rep(i, n)
    {
        cin >> l_list[i];
    }
    rep(i, n)
    {
        cin >> r_list[i];
    }
    rep(i, n)
    {
        cin >> d_list[i];
    }

    v.emplace_back(d_list[0]);
    ans = get_digitsum(v, l_list[0], r_list[0]);

    rep(i, n - 1)
    {
        v = disitsum_move(d_list[i], d_list[i + 1]);
        ans *= get_digitsum(v, l_list[i + 1], r_list[i + 1]);
        ans %= mod;
    }
    cout << ans << rt;

    return 0;
}