結果
問題 | No.1086 桁和の桁和2 |
ユーザー |
![]() |
提出日時 | 2020-06-19 21:58:07 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 112 ms / 3,000 ms |
コード長 | 2,832 bytes |
コンパイル時間 | 1,105 ms |
コンパイル使用メモリ | 115,356 KB |
実行使用メモリ | 5,632 KB |
最終ジャッジ日時 | 2024-07-22 17:39:38 |
合計ジャッジ時間 | 4,228 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 31 |
ソースコード
#include <iostream>#include <vector>#include <algorithm>#include <cmath>#include <string>#include <queue>#include <stack>#include <set>#include <map>#include <iomanip>#include <utility>#include <tuple>#include <functional>#include <bitset>#include <cassert>#include <complex>#include <stdio.h>#include <time.h>#include <numeric>#include <random>#include <unordered_map>#include <unordered_set>#define all(a) a.begin(),a.end()#define rep(i, n) for (ll i = 0; i < (n); i++)#define pb push_back#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")using namespace std;typedef long long ll;typedef unsigned long long ull;typedef long double ld;typedef pair<ll, ll> P;typedef complex<ld> com;constexpr int inf = 1000000000;constexpr ll INF = 1000000000000000010;constexpr ld eps = 1e-12;constexpr ld pi = 3.141592653589793238;template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }constexpr ll mod = 1000000007;constexpr ll modsize = 0;vector<ll> fac(modsize);vector<ll> inv(modsize);vector<ll> facinv(modsize);void modcalc() {if (modsize == 0) abort();fac[0] = 1; fac[1] = 1; inv[1] = 1;facinv[0] = 1; facinv[1] = 1;for (ll i = 2; i < modsize; i++) {fac[i] = fac[i - 1] * i % mod;inv[i] = mod - inv[mod % i] * (mod / i) % mod;facinv[i] = facinv[i - 1] * inv[i] % mod;}}ll modinv(ll a) {if (a == 0) abort();ll b = mod, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= mod;if (u < 0) u += mod;return u;}ll modpow(ll a, ll b) {ll ans = 1;a %= mod;while (b) {if (b & 1) ans = ans * a % mod;a = a * a % mod;b >>= 1;}return ans;}ll modcomb(ll n, ll k) {if (n < 0 || k < 0 || n < k) return 0;return fac[n] * facinv[k] % mod * facinv[n - k] % mod;}ll modperm(ll n, ll k) {if (n < 0 || k < 0 || n < k) return 0;return fac[n] * facinv[n - k] % mod;}ll modhom(ll n, ll k) {if (n < 0 || k < 0 || n == 0 && k > 0) return 0;if (n == 0 && k == 0) return 1;return fac[n + k - 1] * facinv[k] % mod * facinv[n - 1] % mod;}signed main() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(20);int n;cin >> n;vector<ll> l(n), r(n), d(n);rep(i, n) cin >> l[i];rep(i, n) cin >> r[i];rep(i, n) cin >> d[i];rep(i, n - 1) {if (d[i] != 0 && d[i + 1] == 0) {cout << "0\n";return 0;}}int st = 0;while (st < n && d[st] == 0) st++;ll ans = 1;for (int i = st; i < n; i++) {ll cnt = (modpow(10, r[i]) - modpow(10, l[i]) + mod) * modinv(9) % mod;if (i > 0 && d[i] == d[i - 1]) cnt++;ans *= cnt;ans %= mod;}cout << ans << '\n';}