結果

問題 No.1086 桁和の桁和2
ユーザー ei1333333ei1333333
提出日時 2020-06-19 22:15:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 173 ms / 3,000 ms
コード長 4,729 bytes
コンパイル時間 2,242 ms
コンパイル使用メモリ 205,300 KB
実行使用メモリ 5,560 KB
最終ジャッジ日時 2023-09-29 23:45:16
合計ジャッジ時間 7,071 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 172 ms
5,448 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 107 ms
4,560 KB
testcase_11 AC 30 ms
4,380 KB
testcase_12 AC 7 ms
4,380 KB
testcase_13 AC 136 ms
4,828 KB
testcase_14 AC 86 ms
4,376 KB
testcase_15 AC 23 ms
4,376 KB
testcase_16 AC 121 ms
4,648 KB
testcase_17 AC 12 ms
4,376 KB
testcase_18 AC 168 ms
5,364 KB
testcase_19 AC 137 ms
5,032 KB
testcase_20 AC 18 ms
4,380 KB
testcase_21 AC 118 ms
4,560 KB
testcase_22 AC 167 ms
5,480 KB
testcase_23 AC 102 ms
4,588 KB
testcase_24 AC 72 ms
4,376 KB
testcase_25 AC 141 ms
4,832 KB
testcase_26 AC 117 ms
4,500 KB
testcase_27 AC 87 ms
4,380 KB
testcase_28 AC 71 ms
4,376 KB
testcase_29 AC 79 ms
4,380 KB
testcase_30 AC 172 ms
5,340 KB
testcase_31 AC 172 ms
5,560 KB
testcase_32 AC 173 ms
5,320 KB
testcase_33 AC 172 ms
5,560 KB
testcase_34 AC 173 ms
5,340 KB
testcase_35 AC 173 ms
5,440 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = (int) (1e9 + 7);
//const int mod = 998244353;

const int64 infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< mod >;


int main() {
  int N;
  cin >> N;
  vector< int64 > L(N), R(N), D(N);
  cin >> L >> R >> D;

  auto solve = [&](int64 P) {
    auto tap = modint(10).pow(P) - 1;
    tap /= 9;
    auto coef = make_v< modint >(9);
    for(int i = 0; i < 9; i++) coef[i] = tap;
    return coef;
  };

  auto dp = make_v< modint >(10);
  dp[9] = 1;
  for(int i = 0; i < N; i++) {
    vector< modint > coef(10);
    auto x = solve(R[i]);
    auto y = solve(L[i]);
    for(int j = 0; j < 9; j++) coef[j] += x[j];
    for(int j = 0; j < 9; j++) coef[j] -= y[j];
    coef[9] += 1; // 0
    auto dp2 = make_v< modint >(10);
    for(int j = 0; j < 9; j++) {
      for(int k = 0; k < 10; k++) {
        dp2[j] += dp[(j * 10 + k) % 9] * coef[k];
      }
    }
    for(int j = 0; j < 10; j++) {
      dp2[j] += dp[9] * coef[j];
    }
    if(D[i] == 9) D[i] = 0;
    else if(D[i] == 0) D[i] = 9;
    for(int j = 0; j < 10; j++) {
      if(D[i] != j) dp2[j] = 0;
    }
    dp2.swap(dp);
  }
  cout << accumulate(begin(dp), end(dp), modint(0)) << "\n";
}
0