結果

問題 No.1086 桁和の桁和2
ユーザー 👑 はまやんはまやんはまやんはまやん
提出日時 2020-06-20 16:19:40
言語 C++17(1z)
(gcc 10.2.0 + boost 1.73.0)
結果
AC  
実行時間 117 ms / 3,000 ms
コード長 3,994 Byte
コンパイル時間 1,899 ms
使用メモリ 5,768 KB
最終ジャッジ日時 2021-02-15 05:48:06
合計ジャッジ時間 5,928 ms
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 2 ms
3,808 KB
testcase_01 AC 2 ms
3,636 KB
testcase_02 AC 2 ms
3,772 KB
testcase_03 AC 2 ms
3,540 KB
testcase_04 AC 2 ms
3,616 KB
testcase_05 AC 108 ms
5,524 KB
testcase_06 AC 2 ms
3,748 KB
testcase_07 AC 2 ms
3,548 KB
testcase_08 AC 2 ms
3,612 KB
testcase_09 AC 2 ms
3,640 KB
testcase_10 AC 68 ms
4,816 KB
testcase_11 AC 20 ms
4,068 KB
testcase_12 AC 5 ms
3,632 KB
testcase_13 AC 86 ms
5,148 KB
testcase_14 AC 55 ms
4,460 KB
testcase_15 AC 17 ms
4,012 KB
testcase_16 AC 82 ms
5,132 KB
testcase_17 AC 9 ms
3,884 KB
testcase_18 AC 113 ms
5,428 KB
testcase_19 AC 93 ms
5,172 KB
testcase_20 AC 13 ms
3,920 KB
testcase_21 AC 81 ms
5,052 KB
testcase_22 AC 113 ms
5,664 KB
testcase_23 AC 70 ms
4,836 KB
testcase_24 AC 49 ms
4,328 KB
testcase_25 AC 95 ms
5,124 KB
testcase_26 AC 79 ms
5,148 KB
testcase_27 AC 57 ms
4,620 KB
testcase_28 AC 48 ms
4,576 KB
testcase_29 AC 54 ms
4,584 KB
testcase_30 AC 116 ms
5,720 KB
testcase_31 AC 116 ms
5,732 KB
testcase_32 AC 116 ms
5,768 KB
testcase_33 AC 116 ms
5,712 KB
testcase_34 AC 117 ms
5,720 KB
testcase_35 AC 109 ms
5,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan0
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/














int N; ll L[101010], R[101010]; int D[101010];
mint dp[101010];
//---------------------------------------------------------------------------------------------------
mint count(ll r, int mo) {
    if (r == 0) return 0;
    return ((mint(10) ^ r) - 1) / 9;
}
mint count(ll L, ll R, int mo) {
    return count(R, mo) - count(L, mo);
}
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;
    rep(i, 0, N) cin >> L[i];
    rep(i, 0, N) cin >> R[i];
    rep(i, 0, N) cin >> D[i];

    dp[0] = 1;
    bool allzero = true;
    int mo = 0;
    rep(i, 0, N) {
        if (D[i] == 0) {
            if (allzero) dp[i + 1] = dp[i];
        }
        else {
            D[i] %= 9;
            if (mo == D[i] && !allzero) dp[i + 1] += dp[i];
            rep(nxt, 0, 9) if ((mo + nxt) % 9 == D[i]) dp[i + 1] += dp[i] * count(L[i], R[i], nxt);
            allzero = false;
            mo = D[i];
        }
    }
    cout << dp[N] << endl;
}





0