#1166147 (C++17) No.3548 SigMax Digits (Construction ver.)

• 問題: No.3548 SigMax Digits (Construction ver.)
• ユーザー: 👑 potato167
• 提出日時: 2026-05-22 23:08:21
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 3,090 bytes
• コンパイル時間: 2,010 ms
• コンパイル使用メモリ: 221,164 KB
• 実行使用メモリ: 50,432 KB
• 最終ジャッジ日時: 2026-05-22 23:08:44
• 合計ジャッジ時間: 5,807 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_1

ファイルパターン	結果
sample	WA * 1
other	WA * 2 TLE * 1 -- * 4

ソースコード

#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;}

ll h(ll a, ll b) {
    vector<ll> dp(3);
    dp[1] = 1;
    while (a) {
        ll tmp = a % 10;
        a /= 10;
        vector<ll> n_dp(3);
        ll x = min(b, tmp);
        ll y = 0;
        ll z = b - x;
        if (z) {
            z--;
            y++;
        }
        if (y) n_dp = dp;
        ll sum = vec_sum(dp);
        n_dp[0] += x * sum;
        n_dp[2] += z * sum;
        swap(n_dp, dp);
    }
    return dp[0];
}

map<ll, ll> m;
ll g(ll a) {
    if (m.count(a)) return m[a];
    ll res = 0;
    rep(i, 0, 10) {
        res += a - h(a, i + 1);
        // cout << a << " " << i + 1 << " " << h(a, i + 1) << "\n";
    }
    m[a] = res;
    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(){
    ll N;
    cin >> N;
    auto f = [&](ll a) -> ll {
        ll res = 0;
        while (a) {
            chmax(res, a % 10);
            a /= 10;
        }
        return res;
    };
    ll l = 1, r = 2;
    while (g(r) < N) r *= 2;
    while (r - l > 1) {
        ll m = (r + l) / 2;
        if (g(m) < N) l = m;
        else r = m;
    }
    ll sum = g(r);
    l = 1;
    while (sum != N) {
        if (sum > N) sum -= f(l), l++;
        else sum += f(r), r++;
    }
    if (r - l < 100){
        ll tmp = 0;
        rep(i, l, r) {
            tmp += f(i);
        }
        cout << tmp << "\n";
    }
}