結果

問題 No.2772 Appearing Even Times
ユーザー dyktr_06dyktr_06
提出日時 2024-05-31 22:50:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 637 ms / 4,000 ms
コード長 9,150 bytes
コンパイル時間 2,457 ms
コンパイル使用メモリ 206,632 KB
実行使用メモリ 323,808 KB
最終ジャッジ日時 2024-12-21 00:48:01
合計ジャッジ時間 12,443 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 141 ms
323,744 KB
testcase_01 AC 140 ms
323,704 KB
testcase_02 AC 142 ms
323,632 KB
testcase_03 AC 141 ms
323,628 KB
testcase_04 AC 145 ms
323,640 KB
testcase_05 AC 141 ms
323,620 KB
testcase_06 AC 143 ms
323,672 KB
testcase_07 AC 143 ms
323,692 KB
testcase_08 AC 615 ms
323,676 KB
testcase_09 AC 613 ms
323,756 KB
testcase_10 AC 127 ms
323,692 KB
testcase_11 AC 129 ms
323,676 KB
testcase_12 AC 635 ms
323,808 KB
testcase_13 AC 635 ms
323,688 KB
testcase_14 AC 631 ms
323,712 KB
testcase_15 AC 627 ms
323,648 KB
testcase_16 AC 636 ms
323,700 KB
testcase_17 AC 625 ms
323,676 KB
testcase_18 AC 619 ms
323,668 KB
testcase_19 AC 629 ms
323,780 KB
testcase_20 AC 637 ms
323,664 KB
testcase_21 AC 625 ms
323,668 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; 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, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const 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, const 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 <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <long long Modulus>
struct ModInt{
    long long val;
    constexpr ModInt(const long long _val = 0) noexcept : val(_val) {
        normalize();
    }
    void normalize(){
        val = (val % Modulus + Modulus) % Modulus;
    }
    inline ModInt &operator+=(const ModInt &rhs) noexcept {
        if(val += rhs.val, val >= Modulus) val -= Modulus;
        return *this;
    }
    inline ModInt &operator-=(const ModInt &rhs) noexcept {
        if(val -= rhs.val, val < 0) val += Modulus;
        return *this;
    }
    inline ModInt &operator*=(const ModInt &rhs) noexcept {
        val = val * rhs.val % Modulus;
        return *this;
    }
    inline ModInt &operator/=(const ModInt &rhs) noexcept {
        val = val * inv(rhs.val).val % Modulus;
        return *this;
    }
    inline ModInt &operator++() noexcept {
        if(++val >= Modulus) val -= Modulus;
        return *this;
    }
    inline ModInt operator++(int) noexcept {
        ModInt t = val;
        if(++val >= Modulus) val -= Modulus;
        return t;
    }
    inline ModInt &operator--() noexcept {
        if(--val < 0) val += Modulus;
        return *this;
    }
    inline ModInt operator--(int) noexcept {
        ModInt t = val;
        if(--val < 0) val += Modulus;
        return t;
    }
    inline ModInt operator-() const noexcept { return (Modulus - val) % Modulus; }
    inline ModInt inv(void) const { return inv(val); }
    ModInt pow(long long n){
        assert(0 <= n);
        ModInt x = *this, r = 1;
        while(n){
            if(n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    ModInt inv(const long long n) const {
        long long a = n, b = Modulus, u = 1, v = 0;
        while(b){
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        u %= Modulus;
        if(u < 0) u += Modulus;
        return u;
    }
    friend inline ModInt operator+(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) += rhs; }
    friend inline ModInt operator-(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) -= rhs; }
    friend inline ModInt operator*(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) *= rhs; }
    friend inline ModInt operator/(const ModInt &lhs, const ModInt &rhs) noexcept { return ModInt(lhs) /= rhs; }
    friend inline bool operator==(const ModInt &lhs, const ModInt &rhs) noexcept { return lhs.val == rhs.val; }
    friend inline bool operator!=(const ModInt &lhs, const ModInt &rhs) noexcept { return lhs.val != rhs.val; }
    friend inline istream &operator>>(istream &is, ModInt &x) noexcept {
        is >> x.val;
        x.normalize();
        return is;
    }
    friend inline ostream &operator<<(ostream &os, const ModInt &x) noexcept { return os << x.val; }
};

using mint = ModInt<MOD>;

void input(){
}

mint dp[10010][1 << 10][2][2];

void solve(){
    string n; in(n);
    ll siz = n.size();
    dp[0][0][1][0] = 1;
    rep(i, siz){
        ll num = n[i] - '0';
        rep(j, 1 << 10){
            rep(k, 10){
                if(k < num){
                    if(k == 0){
                        dp[i + 1][j][0][0] += dp[i][j][1][0];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][1][1];
                        dp[i + 1][j][0][0] += dp[i][j][0][0];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][1];
                    }else{
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][1][0];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][1][1];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][0];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][1];
                    }
                }else if(k == num){
                    if(k == 0){
                        dp[i + 1][j][1][0] += dp[i][j][1][0];
                        dp[i + 1][j ^ (1 << k)][1][1] += dp[i][j][1][1];
                        dp[i + 1][j][0][0] += dp[i][j][0][0];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][1];
                    }else{
                        dp[i + 1][j ^ (1 << k)][1][1] += dp[i][j][1][0];
                        dp[i + 1][j ^ (1 << k)][1][1] += dp[i][j][1][1];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][0];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][1];
                    }
                }else{
                    if(k == 0){
                        dp[i + 1][j][0][0] += dp[i][j][0][0];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][1];
                    }else{
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][0];
                        dp[i + 1][j ^ (1 << k)][0][1] += dp[i][j][0][1];
                    }
                }
            }
        }
    }
    mint ans = 0;
    rep(k, 2) rep(l, 2){
        ans += dp[siz][0][k][l];
    }
    out(ans - 1);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);

    input();
    solve();
}
0