結果

問題 No.3316 Make 81181819 with only 0,1,or 8
コンテスト
ユーザー noya2
提出日時 2025-10-31 21:41:21
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 6,000 ms
コード長 6,686 bytes
コンパイル時間 3,692 ms
コンパイル使用メモリ 305,112 KB
実行使用メモリ 7,716 KB
最終ジャッジ日時 2025-10-31 21:41:26
合計ジャッジ時間 4,953 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

bool calc(int n, int k){
    vector<int> add;
    rep(a,k+1) rep(b,k+1-a){
        int x = a * 8 + b;
        add.emplace_back(x);
    }
    uniq(add);
    int ma = ranges::max(add);
    vector<bool> dp(1,true);
    while (n){
        int sz = dp.size();
        vector<bool> ep(sz+ma);
        rep(i,sz){
            if (!dp[i]) continue;
            for (int x : add){
                ep[i + x] = true;
            }
        }
        int nsz = ep.size();
        vector<bool> ndp(nsz/10+1);
        for (int d = n % 10, p = 0; d < sz+ma; d += 10, p++){
            ndp[p] = ep[d];
        }
        swap(dp,ndp);
        n /= 10;
    }
    return dp[0];
}

vector<int> construct(int n, int k){
    int ma = 8*k;
    vector<vector<pii>> dp(9);
    dp[0] = {{0,0}};
    rep(t,8){
        int sz = dp[t].size();
        dp[t+1].resize((sz+ma)/10+1,{-1,-1});
        rep(i,sz){
            if (get<0>(dp[t][i]) == -1) continue;
            rep(a,k+1) rep(b,k+1-a){
                int x = a * 8 + b;
                int tar = i + x;
                if (tar % 10 == n % 10){
                    int ni = tar / 10;
                    dp[t+1][ni] = {i,x};
                }
            }
        }
        n /= 10;
    }
    assert(dp[8][0].first != -1);
    vector ansstr(k,string(8,'?'));
    int s = 0;
    reb(t,8){
        auto [ns, x] = dp[t+1][s];
        assert(ns != -1);
        int ia = -1, ib = -1;
        rep(a,k+1) rep(b,k+1-a){
            if (a * 8 + b == x){
                ia = a;
                ib = b;
                break;
            }
        }
        assert(ia != -1);
        rep(i,ia){
            ansstr[i][t] = '8';
        }
        repp(i,ia,ia+ib){
            ansstr[i][t] = '1';
        }
        repp(i,ia+ib,k){
            ansstr[i][t] = '0';
        }
        s = ns;
    }
    vector<int> ans(k);
    rep(i,k){
        int x = 0;
        for (auto c : ansstr[i] | views::reverse){
            x *= 10;
            x += int(c - '0');
        }
        ans[i] = x;
    }
    return ans;
}

void solve(){
    int n; in(n);
    n = 81181819 - n;
    for (int k = 1; k <= 9; k++){
        if (calc(n,k)){
            out(k);
            auto ans = construct(n,k);
            for (auto x : ans){
                out(x);
            }
            return ;
        }
    }
}

int main(){
    int t = 1; in(t);
    while (t--) { solve(); }
}
0