#945881 (C++17) No.260 世界のなんとか3

提出ソース

結果

問題	No.260 世界のなんとか3
ユーザー	hibit_at
提出日時	2024-01-23 09:45:12
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	222 ms / 2,000 ms
コード長	5,963 bytes
コンパイル時間	1,981 ms
コンパイル使用メモリ	138,224 KB
実行使用メモリ	6,676 KB
最終ジャッジ日時	2024-01-23 09:45:19
合計ジャッジ時間	6,241 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	222 ms 6,676 KB
testcase_04	AC	196 ms 6,676 KB
testcase_05	AC	39 ms 6,676 KB
testcase_06	AC	26 ms 6,676 KB
testcase_07	AC	133 ms 6,676 KB
testcase_08	AC	93 ms 6,676 KB
testcase_09	AC	52 ms 6,676 KB
testcase_10	AC	150 ms 6,676 KB
testcase_11	AC	141 ms 6,676 KB
testcase_12	AC	109 ms 6,676 KB
testcase_13	AC	26 ms 6,676 KB
testcase_14	AC	136 ms 6,676 KB
testcase_15	AC	35 ms 6,676 KB
testcase_16	AC	112 ms 6,676 KB
testcase_17	AC	88 ms 6,676 KB
testcase_18	AC	85 ms 6,676 KB
testcase_19	AC	110 ms 6,676 KB
testcase_20	AC	78 ms 6,676 KB
testcase_21	AC	70 ms 6,676 KB
testcase_22	AC	127 ms 6,676 KB
testcase_23	AC	13 ms 6,676 KB
testcase_24	AC	123 ms 6,676 KB
testcase_25	AC	98 ms 6,676 KB
testcase_26	AC	97 ms 6,676 KB
testcase_27	AC	2 ms 6,676 KB
testcase_28	AC	196 ms 6,676 KB
testcase_29	AC	195 ms 6,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

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 != (int)v.size() ? " " : "");
    }
    return os;
}

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

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    int n = v.size();
    int m = v[0].size();
    int p = v[0][0].size();
    rep(k, p)
    {
        os << "k = " << k << endl;
        rep(i, n)
        {
            rep(j, m)
            {
                os << v[i][j][k];
                if (j < m - 1)
                {
                    os << " ";
                }
                else
                {
                    os << endl;
                }
            }
        }
    }
    return os;
}

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

template <typename T, typename S>
ostream &operator<<(ostream &os, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    cout << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, set<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, multiset<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}

#include <atcoder/modint>
using namespace atcoder;
using mint = modint1000000007;
ostream &operator<<(ostream &os, mint &i)
{
    os << i.val();
    return os;
}

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

mint solve(string s)
{
    vector<int> a;
    for (char c : s)
    {
        a.push_back(c - '0');
    }
    // debug(a);
    int m = s.size();
    using VI = vector<mint>;
    using VVI = vector<VI>;
    using VVVI = vector<VVI>;
    using VVVVI = vector<VVVI>;
    using VVVVVI = vector<VVVVI>;
    VVVVI dp(3,VVVI(8, VVI(2, VI(2))));
    dp[0][0][0][0] = 1;
    vector<int> factor(m,1);
    rep(i,m-1){
        factor[i+1] = factor[i]*10;
        factor[i+1] %= 8;
    }
    // debug(factor);
    reverse(all(factor));
    rep(i, m)
    {
        VVVVI ndp(3,VVVI(8, VVI(2, VI(2))));
        rep(mod3, 3)
        {
            rep(mod8, 8)
            {
                rep(contains, 2)
                {
                    rep(small, 2)
                    {
                        rep(next, 10)
                        {
                            ndp[(mod3 + next) % 3][(mod8 + next*factor[i]) % 8][contains || next == 3][small || next < a[i]] += dp[mod3][mod8][contains][small] * (small || next <= a[i]);
                        }
                    }
                }
            }
        }
        dp = ndp;
    }
    mint ans = 0;
    rep(mod3, 3)
    {
        rep(mod8, 8)
        {
            rep(contains, 2)
            {
                rep(small, 2)
                {
                    if((mod3==0||contains) && mod8>0){
                        ans += dp[mod3][mod8][contains][small];
                    }
                }
            }
        }
    }
    return ans;
}
int main()
{
    string a, b;
    cin >> a >> b;
    vector<int> v;
    for (char c : a)
    {
        v.push_back(c - '0');
    }
    reverse(all(v));
    // debug(v);
    int n = v.size();
    v[0]--;
    rep(i, n - 1)
    {
        if (v[i] < 0)
        {
            v[i] = 9;
            v[i + 1]--;
        }
    }
    // debug(v);
    string c;
    for (int i : v)
    {
        c.push_back('0' + i);
    }
    reverse(all(c));
    // debug(c);
    mint ans = solve(b) - solve(c);
    cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード