結果

問題 No.260 世界のなんとか3
ユーザー fumiphysfumiphys
提出日時 2019-10-18 02:50:01
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 4,348 bytes
コンパイル時間 1,600 ms
コンパイル使用メモリ 168,668 KB
実行使用メモリ 7,360 KB
最終ジャッジ日時 2023-09-07 20:12:55
合計ジャッジ時間 3,540 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,376 KB
testcase_03 AC 40 ms
7,148 KB
testcase_04 AC 40 ms
7,152 KB
testcase_05 AC 9 ms
4,784 KB
testcase_06 AC 7 ms
4,384 KB
testcase_07 AC 28 ms
6,592 KB
testcase_08 AC 20 ms
6,620 KB
testcase_09 AC 12 ms
4,960 KB
testcase_10 AC 31 ms
6,508 KB
testcase_11 AC 29 ms
6,796 KB
testcase_12 AC 19 ms
6,116 KB
testcase_13 AC 6 ms
4,376 KB
testcase_14 AC 27 ms
6,752 KB
testcase_15 AC 8 ms
4,376 KB
testcase_16 AC 23 ms
5,976 KB
testcase_17 AC 19 ms
5,432 KB
testcase_18 AC 18 ms
5,076 KB
testcase_19 AC 24 ms
6,608 KB
testcase_20 AC 18 ms
5,448 KB
testcase_21 AC 16 ms
5,568 KB
testcase_22 AC 27 ms
6,312 KB
testcase_23 AC 4 ms
4,376 KB
testcase_24 AC 22 ms
6,460 KB
testcase_25 AC 22 ms
7,184 KB
testcase_26 AC 22 ms
7,156 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 40 ms
7,360 KB
testcase_29 AC 40 ms
7,276 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#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 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 bit(n) (1LL<<(n))
// functions
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
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

ll dp[10010][2][3][8];

ll calc(string &s){
  rep(i, sz(s) + 1)rep(j, 2)rep(k, 3)rep(l, 8)dp[i][j][k][l] = 0;
  ll curr = 0;
  bool th = false;
  rep(i, sz(s)){
    rep(j, 2){
      rep(k, 3){
        rep(l, 8){
          rep(m, 10){
            int K = (k * 10 + m) % 3, L = (l * 10 + m) % 8;
            if(m == 3){
              (dp[i+1][1][K][L] += dp[i][j][k][l]) %= mod;
            }else{
              (dp[i+1][j][K][L] += dp[i][j][k][l]) %= mod;
            }
          }
        }
      }
    }
    rep(m, int(s[i] - '0')){
      int K = (curr * 10 + m) % 3, L = (curr * 10 + m) % 8;
      if(m == 3){
        (dp[i+1][1][K][L] += 1) %= mod;
      }else{
        (dp[i+1][th][K][L] += 1) %= mod;
      }
    }
    curr = (curr * 10 + int(s[i] - '0')) % 24;
    if(s[i] == '3')th = true;
  }

  ll res = 0;
  FOR(i, 1, 8){
    (res += dp[sz(s)][0][0][i]) %= mod;
    (res += dp[sz(s)][1][0][i]) %= mod;
    (res += dp[sz(s)][1][1][i]) %= mod;
    (res += dp[sz(s)][1][2][i]) %= mod;
  }
  if((th || curr % 3 == 0) && curr % 8 > 0)(res += 1) %= mod;
  return res;
}

int main(int argc, char const* argv[])
{
  string a, b; cin >> a >> b;
  ll res = calc(b);
  for(int i = sz(a) - 1; i >= 0; i--){
    if(a[i] > '0'){
      a[i] = char(int(a[i] - '0') - 1 + '0');
      break;
    }else{
      a[i] = '9';
    }
  }
  while(a.size() > 1 && a[0] == '0'){
    a = a.substr(1, sz(a)-1);
  }
  res -= calc(a);
  if(res < 0)res += mod;
  cout << res << endl;
  return 0;
}
0