結果

問題 No.315 世界のなんとか3.5
ユーザー risujiroh
提出日時 2018-09-08 17:49:54
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,428 ms / 2,000 ms
コード長 2,569 bytes
コンパイル時間 3,376 ms
コンパイル使用メモリ 187,532 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-17 12:44:39
合計ジャッジ時間 18,086 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u) { v.resize(n); for (auto&& i : v) assign(i, u...); }
const lint mod = 1e9 + 7;
inline lint emod(lint a, lint p = mod) { return (a % p + p) % p; }
int main() {
  cin.tie(NULL); ios::sync_with_stdio(false);
  string a, b; cin >> a >> b;
  int p; cin >> p;
  auto calc = [&](string x, int in) {
    x = "00" + x;
    int n = x.size();
    VV<VV<V<lint>>> dp; assign(dp, 4, 2, 3, 2, 8);
    dp[0][1][0][0][0] = 1;
    for (int i = 0; i < n; i++) {
      assign(dp[i + 1 & 3], 2, 3, 2, 8, 0LL);
      for (int r = 0; r < 3; r++) for (int s = 0; s < 8; s++) for (int d = 0; d < 10; d++) {
        (dp[i + 1 & 3][0][(r + d) % 3][d == 3][2 * s + d & 7] += dp[i & 3][0][r][0][s]) %= mod;
        (dp[i + 1 & 3][0][(r + d) % 3][1][2 * s + d & 7] += dp[i & 3][0][r][1][s]) %= mod;
        if (d > x[i] - '0') continue;
        (dp[i + 1 & 3][d == x[i] - '0'][(r + d) % 3][d == 3][2 * s + d & 7] += dp[i & 3][1][r][0][s]) %= mod;
        (dp[i + 1 & 3][d == x[i] - '0'][(r + d) % 3][1][2 * s + d & 7] += dp[i & 3][1][r][1][s]) %= mod;
      }
    }
    lint res = 0;
    if (p == 8) {
      for (int f = 0; f < 2; f++) for (int r = 0; r < 3; r++) for (int g = 0; g < 2; g++) for (int s = 0; s < 8; s++) if (f <= in and (!r or g) and s) 
          (res += dp[n & 3][f][r][g][s]) %= mod;
    } else if (p == 80) {
      for (int f = 0; f < 2; f++) for (int r = 0; r < 3; r++) for (int g = 0; g < 2; g++) for (int s = 0; s < 8; s++) if (f <= in and (!r or g)) (res 
          += dp[n & 3][f][r][g][s]) % mod;
      if (!in and x[n - 1] != '0') in = 1;
      for (int f = 0; f < 2; f++) for (int r = 0; r < 3; r++) for (int g = 0; g < 2; g++) for (int s = 0; s < 8; s++) if (f <= in and (!r or g) and !s
          ) (res -= dp[n - 1 & 3][f][r][g][s]) %= mod;
    } else {
      for (int f = 0; f < 2; f++) for (int r = 0; r < 3; r++) for (int g = 0; g < 2; g++) for (int s = 0; s < 8; s++) if (f <= in and (!r or g)) (res 
          += dp[n & 3][f][r][g][s]) %= mod;
      if (!in and !(x[n - 2] == '0' and x[n - 1] == '0')) in = 1;
      for (int f = 0; f < 2; f++) for (int r = 0; r < 3; r++) for (int g = 0; g < 2; g++) for (int s = 0; s < 8; s++) if (f <= in and (!r or g) and !s
          ) (res -= dp[n - 2 & 3][f][r][g][s]) %= mod;
    }
    return res;
  };
  cout << emod(calc(b, 1) - calc(a, 0)) << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0