#945528 (C++17) No.741 AscNumber(Easy)

• 問題: No.741 AscNumber(Easy)
• ユーザー: hibit_at
• 提出日時: 2024-01-20 17:54:31
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,133 ms / 2,000 ms
• コード長: 4,797 bytes
• コンパイル時間: 1,467 ms
• コンパイル使用メモリ: 122,456 KB
• 実行使用メモリ: 7,200 KB
• 最終ジャッジ日時: 2024-01-20 17:54:49
• 合計ジャッジ時間: 17,381 ms
• ジャッジサーバーID （参考情報）: judge11 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	1 ms; 6,676 KB
testcase_03	AC	2 ms; 6,676 KB
testcase_04	AC	1 ms; 6,676 KB
testcase_05	AC	2 ms; 6,676 KB
testcase_06	AC	2 ms; 6,676 KB
testcase_07	AC	1 ms; 6,676 KB
testcase_08	AC	2 ms; 6,676 KB
testcase_09	AC	2 ms; 6,676 KB
testcase_10	AC	2 ms; 6,676 KB
testcase_11	AC	2 ms; 6,676 KB
testcase_12	AC	2 ms; 6,676 KB
testcase_13	AC	2 ms; 6,676 KB
testcase_14	AC	1 ms; 6,676 KB
testcase_15	AC	1 ms; 6,676 KB
testcase_16	AC	2 ms; 6,676 KB
testcase_17	AC	2 ms; 6,676 KB
testcase_18	AC	2 ms; 6,676 KB
testcase_19	AC	1 ms; 6,676 KB
testcase_20	AC	2 ms; 6,676 KB
testcase_21	AC	2 ms; 6,676 KB
testcase_22	AC	3 ms; 6,676 KB
testcase_23	AC	2 ms; 6,676 KB
testcase_24	AC	2 ms; 6,676 KB
testcase_25	AC	2 ms; 6,676 KB
testcase_26	AC	2 ms; 6,676 KB
testcase_27	AC	2 ms; 6,676 KB
testcase_28	AC	2 ms; 6,676 KB
testcase_29	AC	2 ms; 6,676 KB
testcase_30	AC	2 ms; 6,676 KB
testcase_31	AC	2 ms; 6,676 KB
testcase_32	AC	2 ms; 6,676 KB
testcase_33	AC	3 ms; 6,676 KB
testcase_34	AC	3 ms; 6,676 KB
testcase_35	AC	1,056 ms; 7,016 KB
testcase_36	AC	462 ms; 6,676 KB
testcase_37	AC	545 ms; 6,676 KB
testcase_38	AC	531 ms; 6,676 KB
testcase_39	AC	453 ms; 6,676 KB
testcase_40	AC	614 ms; 6,676 KB
testcase_41	AC	971 ms; 6,784 KB
testcase_42	AC	513 ms; 6,676 KB
testcase_43	AC	369 ms; 6,676 KB
testcase_44	AC	748 ms; 6,676 KB
testcase_45	AC	839 ms; 6,676 KB
testcase_46	AC	1,004 ms; 6,836 KB
testcase_47	AC	169 ms; 6,676 KB
testcase_48	AC	1,004 ms; 6,836 KB
testcase_49	AC	863 ms; 6,676 KB
testcase_50	AC	113 ms; 6,676 KB
testcase_51	AC	392 ms; 6,676 KB
testcase_52	AC	1,107 ms; 7,200 KB
testcase_53	AC	1,133 ms; 7,200 KB
testcase_54	AC	1,120 ms; 7,160 KB

ソースコード

#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;
}
int main()
{
    int n;
    cin >> n;
    vector<int> a(n, 9);
    using VI = vector<mint>;
    using VVI = vector<VI>;
    using VVVI = vector<VVI>;
    using VVVVI = vector<VVVI>;
    using VVVVVI = vector<VVVVI>;
    // VVVI dp(n + 1, VVI(10, VI(2)));
    VVI dp(10, VI(2));
    dp[0][0] = 1;
    rep(i, n)
    {
        VVI ndp(10, VI(2));
        rep(now, 10)
        {
            rep(small, 2)
            {
                rep(next, 10)
                {
                    ndp[next][small || next < a[i]] += dp[now][small] * (small || next <= a[i]) * (now <= next);
                }
            }
        }
        dp = ndp;
    }
    // cout << dp << endl;
    // cout << dp[n] << endl;
    mint ans = 0;
    rep(now, 10)
    {
        rep(small, 2)
        {
            ans += dp[now][small];
        }
    }
    cout << ans << endl;
}