結果

問題 No.260 世界のなんとか3
ユーザー fumiphysfumiphys
提出日時 2019-07-22 22:01:10
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 5,301 bytes
コンパイル時間 1,447 ms
コンパイル使用メモリ 170,460 KB
実行使用メモリ 7,412 KB
最終ジャッジ日時 2023-09-06 00:11:42
合計ジャッジ時間 3,075 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 23 ms
7,288 KB
testcase_04 AC 25 ms
7,412 KB
testcase_05 AC 6 ms
4,784 KB
testcase_06 AC 5 ms
4,380 KB
testcase_07 AC 17 ms
6,628 KB
testcase_08 AC 13 ms
6,676 KB
testcase_09 AC 7 ms
5,040 KB
testcase_10 AC 19 ms
6,428 KB
testcase_11 AC 17 ms
6,848 KB
testcase_12 AC 11 ms
6,052 KB
testcase_13 AC 4 ms
4,376 KB
testcase_14 AC 17 ms
6,760 KB
testcase_15 AC 5 ms
4,376 KB
testcase_16 AC 14 ms
6,080 KB
testcase_17 AC 12 ms
5,336 KB
testcase_18 AC 11 ms
5,284 KB
testcase_19 AC 15 ms
6,632 KB
testcase_20 AC 10 ms
5,424 KB
testcase_21 AC 9 ms
5,624 KB
testcase_22 AC 16 ms
6,104 KB
testcase_23 AC 3 ms
4,376 KB
testcase_24 AC 13 ms
6,424 KB
testcase_25 AC 15 ms
7,188 KB
testcase_26 AC 14 ms
7,160 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 24 ms
7,268 KB
testcase_29 AC 23 ms
7,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
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> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
ll dp[10010][3][8][2];
ll calc(string &a){
  if(sz(a) == 0)return 0;
  vector<int> A(sz(a));
  rep(i, sz(a))A[i] = int(a[i] - '0');
  int n = sz(a);
  rep(i, n + 1)rep(j, 3)rep(k, 8)rep(l, 2)dp[i][j][k][l] = 0;
  int tsum = 0;
  int bsum = 0;
  bool b = false;
  rep(i, n){
    rep(j, 10){
      rep(k, 3){
        rep(l, 8){
          rep(m, 2){
            int k2 = (k + j) % 3;
            int l2 = (l * 10 + j) % 8;
            if(j == 3){
              (dp[i+1][k2][l2][1] += dp[i][k][l][m]) %= mod;
            }else{
              (dp[i+1][k2][l2][m] += dp[i][k][l][m]) %= mod;
            }
          }
        }
      }
    }
    rep(j, A[i]){
      int k2 = (tsum + j) % 3;
      int l2 = (bsum * 10 + j) % 8;
      int m = (b || j == 3) ? 1: 0;
      (dp[i+1][k2][l2][m] += 1) %= mod;
    }
    bsum = (bsum * 10 + A[i]) % 8;
    tsum = (tsum + A[i]) % 3;
    if(A[i] == 3)b = true;
    /*rep(j, 3){
      rep(k, 8){
        rep(l, 2){
          cout << i << " " << j << " " << k << " " << l << " " << dp[i+1][j][k][l] << endl;
        }
      }
      }*/
  }
  ll res = 0;
  if((tsum % 3 == 0 || b) && bsum % 8 > 0)res++;
  FOR(i, 1, 8){
    rep(j, 2){
      res = (res + dp[n][0][i][j]) % mod;
    }
    FOR(j, 1, 3){
      res = (res + dp[n][j][i][1]) % mod;
    }
  }
  return res;
}


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  string a, b; cin >> a >> b;
  int cnt = 0; rep(i, sz(a))if(a[i] == '0')cnt++;
  string t = "";
  if(a[0] == 1 && cnt + 1 == sz(a)){
    rep(i, sz(a) - 1)t += "9";
  }else{
    bool f = false;
    for(int i = sz(a) - 1; i >= 0; i--){
      if(a[i] == '0'){
        if(!f)t += "9";
        else t += "0";
      }else{
        if(!f){
          t += char(a[i] - 1);
          f = true;
        }else{
          t += a[i];
        }
      }
    }
    while(t.back() == '0')t.pop_back();
    reverse(all(t));
  }
  ll res = (calc(b) - calc(t)) % mod;
  if(res < 0)res += mod;
  cout << res << endl;
  return 0;
}
0