#499461 (C++14) No.1086 桁和の桁和2

• 問題: No.1086 桁和の桁和2
• ユーザー: ミドリムシ
• 提出日時: 2020-06-19 22:28:33
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 589 ms / 3,000 ms
• コード長: 4,311 bytes
• コンパイル時間: 1,873 ms
• コンパイル使用メモリ: 172,340 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-22 17:42:22
• 合計ジャッジ時間: 11,795 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	148 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	93 ms; 5,376 KB
testcase_11	AC	26 ms; 5,376 KB
testcase_12	AC	7 ms; 5,376 KB
testcase_13	AC	118 ms; 5,376 KB
testcase_14	AC	73 ms; 5,376 KB
testcase_15	AC	70 ms; 5,376 KB
testcase_16	AC	407 ms; 5,376 KB
testcase_17	AC	35 ms; 5,376 KB
testcase_18	AC	557 ms; 5,376 KB
testcase_19	AC	465 ms; 5,376 KB
testcase_20	AC	59 ms; 5,376 KB
testcase_21	AC	399 ms; 5,376 KB
testcase_22	AC	564 ms; 5,376 KB
testcase_23	AC	345 ms; 5,376 KB
testcase_24	AC	239 ms; 5,376 KB
testcase_25	AC	479 ms; 5,376 KB
testcase_26	AC	397 ms; 5,376 KB
testcase_27	AC	284 ms; 5,376 KB
testcase_28	AC	235 ms; 5,376 KB
testcase_29	AC	263 ms; 5,376 KB
testcase_30	AC	581 ms; 5,376 KB
testcase_31	AC	585 ms; 5,376 KB
testcase_32	AC	589 ms; 5,376 KB
testcase_33	AC	583 ms; 5,376 KB
testcase_34	AC	588 ms; 5,376 KB
testcase_35	AC	149 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)
#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)
#define SZ(x) int(x.size())
constexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;
inline void YES(bool condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
inline void Yes(bool condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
inline void assertNO(bool condition){ if(!condition){ cout << "NO" << endl; exit(0); } }
inline void assertNo(bool condition){ if(!condition){ cout << "No" << endl; exit(0); } }
inline void assertm1(bool condition){ if(!condition){ cout << -1 << endl; exit(0); } }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class T> string to_string(complex<T> x){ return to_string(make_pair(x.real(), x.imag())); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) cout << (i == start ? "" : " ") << (*i); if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint P(int n, int r){ if(r < 0 || n < r) return 0; return (fact[n] * inv[n - r] % mod); } lint C(int p, int q){ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }
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; }
inline int at(lint i, int j){ return (i >> j) & 1; }
random_device rnd;
bool is_in_board(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }

lint power10(lint k){ // (10^k - 1) / 9
    lint ans = power(10, k, mod) - 1;
    return ans * power(9, mod - 2, mod) % mod;
}

int main(){
    int N;
    cin >> N;
    vector<lint> L(N), R(N);
    vector<int> D(N);
    cins(all(L));
    cins(all(R));
    cins(all(D));
    bool is_D_0 = true;
    lint ans = 1;
    rep(i, N){
        if(D[i] == 0){
            if(!is_D_0){
                cout << 0 << endl;
                return 0;
            }
        }else{
            is_D_0 = false;
        }
        if(!is_D_0){
            lint mul = (power10(R[i]) - power10(L[i]) + mod) % mod;
            if(i > 0 && D[i - 1] == D[i]){
                mul++;
            }
            ans = ans * mul % mod;
        }
    }
    cout << ans << endl;
}