#1140453 (C++23) No.3408 1215 Segments

• 問題: No.3408 1215 Segments
• ユーザー: noya2
• 提出日時: 2025-12-15 04:38:29
• 言語: C++23 (gcc 13.3.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 134 ms / 2,500 ms
• コード長: 7,759 bytes
• コンパイル時間: 3,359 ms
• コンパイル使用メモリ: 290,080 KB
• 実行使用メモリ: 7,848 KB
• 最終ジャッジ日時: 2025-12-15 04:38:35
• 合計ジャッジ時間: 5,611 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 4
other	AC * 46

ソースコード

#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"

const vector<vector<int>> example = 
{
{0,2,6,3,1,4},
{1,3},
{4,1,5,2,6},
{4,1,5,3,6},
{0,5,1,3},
{4,0,5,3,6},
{4,0,5,2,3,6},
{0,4,1,3},
{0,1,2,3,4,5,6},
{0,1,3,4,5,6}
};

const int buf = 5;

array<ull,10> bst = {};
void init(){
    rep(i,10){
        for (int pos : example[i]){
            bst[i] |= (1ULL << (pos * buf));
        }
    }
}

bool valid(ull st, array<int,10> dig){
    array<int,7> cnt = {};
    rep(d,7){
        cnt[d] = (st >> (buf * d)) & ((1 << buf) - 1);
    }
    int sum = cnt[2] + cnt[3];
    if (sum % 2 != 0) return false;
    sum /= 2;
    if (cnt[2] > cnt[3]) return false;
    int use1 = sum - cnt[2];
    if (use1 > dig[1]) return false;
    cnt[0] += use1;
    cnt[2] += use1;
    cnt[1] -= use1;
    cnt[3] -= use1;
    // 2, 3 ok
    if (cnt[6] < sum) return false;
    int use9 = cnt[6] - sum;
    if (use9 > dig[9]) return false;
    cnt[6] -= use9;
    // 6 ok
    if (cnt[5] > sum) return false;
    int use0 = sum - cnt[5];
    if (use0 > dig[0]) return false;
    cnt[5] += use0;
    cnt[0] -= use0;
    cnt[4] -= use0;
    cnt[1] -= use0;
    // 5 ok
    if (cnt[1] != sum) return false;
    // 1 ok
    if (cnt[4] < sum) return false;
    int use6 = cnt[4] - sum;
    if (use6 > dig[6]) return false;
    cnt[4] -= use6;
    // 4 ok
    if (cnt[0] < sum) return false;
    int use7 = cnt[0] - sum;
    if (use7 > dig[7]) return false;
    cnt[0] -= use7;
    // 0 ok
    return true;
}

bool is_exist(ull st, int many, array<int,10> dig){
    auto dfs = [&](auto sfs, int start, int pre) -> bool {
        if (start == many){
            return valid(st,dig);
        }
        repp(x,pre,10){
            st += bst[x];
            dig[x]++;
            bool cur = sfs(sfs,start+1,x);
            st -= bst[x];
            dig[x]--;
            if (cur) return true;
        }
        return false;
    };
    return dfs(dfs,0,0);
}

void fast(ll n){
    ll memo = n;
    vector<int> dig;
    while (n){
        dig.emplace_back(n % 10);
        n /= 10;
    }
    int sz = dig.size();
    ull st = 0;
    array<int,10> dcnt = {};
    rep(i,sz){
        st += bst[dig[i]];
        dcnt[dig[i]]++;
    }
    if (is_exist(st,0,dcnt)){
        out(memo);
        return ;
    }
    int front = -1;
    rep(i,sz){
        while (dig[i] < 9){
            st -= bst[dig[i]];
            dcnt[dig[i]]--;
            dig[i]++;
            st += bst[dig[i]];
            dcnt[dig[i]]++;
            if (is_exist(st,i,dcnt)){
                dig[i] = ~dig[i];
                break;
            }
        }
        if (dig[i] == 9){
            st -= bst[dig[i]];
            dcnt[dig[i]]--;
            dig[i] = 0;
            continue;
        }
        dig[i] = ~dig[i];
        assert(1 <= dig[i] && dig[i] <= 9);
        front = i;
        break;
    }
    if (front == -1){
        ll ten = 1;
        rep(tt,sz) ten *= 10;
        fast(ten);
        return ;
    }
    reb(i,front){
        while (true){
            assert(dig[i] <= 9);
            st += bst[dig[i]];
            dcnt[dig[i]]++;
            if (is_exist(st,i,dcnt)){
                break;
            }
            st -= bst[dig[i]];
            dcnt[dig[i]]--;
            dig[i]++;
        }
    }
    ll ans = 0, ten = 1;
    rep(i,sz){
        ans += ten * dig[i];
        ten *= 10;
    }
    out(ans);
}

void solve(){
    ll n; in(n);
    fast(n);
}

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