結果

問題 No.260 世界のなんとか3
ユーザー mikammikam
提出日時 2023-07-01 12:25:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 110 ms / 2,000 ms
コード長 4,697 bytes
コンパイル時間 3,577 ms
コンパイル使用メモリ 248,516 KB
実行使用メモリ 14,140 KB
最終ジャッジ日時 2023-09-22 06:12:48
合計ジャッジ時間 5,839 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 95 ms
13,860 KB
testcase_04 AC 94 ms
13,840 KB
testcase_05 AC 20 ms
6,976 KB
testcase_06 AC 14 ms
6,188 KB
testcase_07 AC 65 ms
12,440 KB
testcase_08 AC 48 ms
12,620 KB
testcase_09 AC 26 ms
7,768 KB
testcase_10 AC 72 ms
11,476 KB
testcase_11 AC 69 ms
13,212 KB
testcase_12 AC 43 ms
10,744 KB
testcase_13 AC 12 ms
4,936 KB
testcase_14 AC 63 ms
12,600 KB
testcase_15 AC 17 ms
5,660 KB
testcase_16 AC 55 ms
11,000 KB
testcase_17 AC 44 ms
8,660 KB
testcase_18 AC 42 ms
7,932 KB
testcase_19 AC 55 ms
12,300 KB
testcase_20 AC 38 ms
8,816 KB
testcase_21 AC 35 ms
9,356 KB
testcase_22 AC 62 ms
11,004 KB
testcase_23 AC 6 ms
4,376 KB
testcase_24 AC 50 ms
11,460 KB
testcase_25 AC 58 ms
14,140 KB
testcase_26 AC 40 ms
14,072 KB
testcase_27 AC 1 ms
4,376 KB
testcase_28 AC 77 ms
13,892 KB
testcase_29 AC 110 ms
13,948 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #include "atcoder/convolution"
#include "atcoder/dsu"
#include "atcoder/fenwicktree"
#include "atcoder/lazysegtree"
#include "atcoder/math"
#include "atcoder/maxflow"
#include "atcoder/mincostflow"
#include "atcoder/modint"
#include "atcoder/scc"
#include "atcoder/segtree"
#include "atcoder/string"
#include "atcoder/twosat"
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> void print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> void print(T& a){cout << a<< '\n';}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 8e18;
using mint = modint1000000007;
//using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    STR(a,b);
    auto solve = [&](string S,int in){
        int n = S.size();
        vector dp(n+1,vector(2,vector(2,vector(3,vector<mint>(8)))));
        dp[0][0][0][0][0] = 1;
        rep(i,n){
            int d = S[i]-'0';
            rep(j,2)rep(k,2)rep(l,3)rep(m,8){
                for(int x=0;x<=(j?9:d);x++){
                    dp[i+1][j|x<d][k|x==3][(l*10+x)%3][(m*10+x)%8]+=dp[i][j][k][l][m];
                }
            }
        }
        mint res = 0;
        rep(k,2)rep(l,3)rep(m,8){
            if(k==0&&l!=0)continue;
            if(m==0)continue;
            res += dp[n][1][k][l][m];
            if(in)res+=dp[n][0][k][l][m];
        }
        return res;
    };
    
    print(solve(b,1)-solve(a,0));
    return 0;
}
0