#1168317 (C++17) No.3566 Subsequence Sum

• 問題: No.3566 Subsequence Sum
• ユーザー: 👑 potato167
• 提出日時: 2026-06-05 21:47:13
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 188 ms / 2,000 ms
• コード長: 3,665 bytes
• コンパイル時間: 1,375 ms
• コンパイル使用メモリ: 216,180 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-06-05 21:47:20
• 合計ジャッジ時間: 3,361 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_1

ファイルパターン	結果
sample	AC * 3
other	AC * 15

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include<atcoder/modint>
using mint = atcoder::modint998244353;

const int D = 21;
using F = array<array<mint, D>, D>;
F op(F l, F r) {
    F res;
    rep(i, 0, D) rep(j, 0, D) {
        res[i][j] = {0};
    }
    rep(i, 0, D) rep(j, 0, D) rep(k, 0, D) {
        res[i][k] += l[i][j] * r[j][k];
    }
    return res;
}

F my_pow(F l, ll times) {
    F res;
    rep(i, 0, D) rep(j, 0, D) res[i][j] = (i == j ? 1 : 0);
    while (times) {
        if (times & 1) {
            res = op(res, l);
        }
        l = op(l, l);
        times /= 2;
    }
    return res;
}

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    string N;
    cin >> N;
    ll K;
    cin >> K;
    F p;
    rep(i, 0, D) {
        array<mint, D> tmp;
        mint sumC = 0, sumS = 0;
        vector<int> seen(10);
        tmp[i] = 1;
        if (i == D - 1){}
        else if (i & 1) sumS = 1;
        else sumC = 1;

        for (auto c : N) {
            int a = c - '0';
            seen[a]++;
            mint sumC2 = sumC;
            mint sumS2 = sumS * 10 + sumC * a;
            sumC2 -= tmp[a * 2];
            sumS2 -= tmp[a * 2 + 1];
            if (a) {
                sumC2 += tmp[D - 1];
                sumS2 += tmp[D - 1] * a;
            }
            sumC += sumC2;
            sumS += sumS2;
            tmp[a * 2] += sumC2;
            tmp[a * 2 + 1] += sumS2;
            /*if (a != 0 && rp == 0 && seen[a] == 1) {
                sumC += tmp[D - 1];
                sumS += tmp[D - 1] * a;
                tmp[a * 2] += tmp[D - 1];
                tmp[a * 2 + 1] += tmp[D - 1] * a;
            }*/
        }
        rep(j, 0, D) p[i][j] = tmp[j];
    }
    auto dp = my_pow(p, K);
    mint ans = 0;
    rep(i, 0, 10) ans += dp[D - 1][i * 2 + 1];
    cout << ans.val() << "\n";
}

/*
 * 末尾が x の部分列の数と総和をもつ
 * x が来たとき、他全てをたし、
 * dp[x] を引く
 */