#768771 (C++14) No.1953 ８

• 問題: No.1953 ８
• ユーザー: woodywoody
• 提出日時: 2022-06-07 00:42:52
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 3 ms / 2,000 ms
• コード長: 6,579 bytes
• コンパイル時間: 4,269 ms
• コンパイル使用メモリ: 244,148 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-21 04:46:52
• 合計ジャッジ時間: 8,073 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	3 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	3 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	3 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

struct math_lib{
    vvl div,mul;

    void div_init(int n){
        div.resize(n+1);
        mul.resize(n+1);

        for(ll i = 1;i <= n;i++){
            for(ll j = i;j <= n;j+=i){
                div[j].pb(i);
                mul[i].pb(j);
            }
        }

        return;
    }

    vl divisor(ll x){
        vl res;
        for(ll i=1;i*i<=x;i++){
            if (x%i != 0) continue;
            res.pb(i);
            if (i*i != x) res.pb(x/i); 
        }
        sort(rng(res));
    
        return res;
    }

    ll sqrt(ll x) {
        ll l = 0, r = ll(2e9)+1;
        while (l+1<r) {
          ll c = (l+r)/2;
          if (c*c <= x) l = c; else r = c;
        }
        return l;
    }

    int logx(ll x,int a){
        ll tmp=1;
        int ret=0;

        while(tmp <= x){
            if (tmp >= LLONG_MAX/a) break;
            tmp *= a;
            ret++;
        }
        ret--;

        return ret;
    }

    ll base(ll x,int a){
        ll ans=0,y;
        for (ll i=0;x>0;i++){
            y = x/a;
            ans += (x - y*a)*pow(10,i);
            x = y;
        }
        return ans;
    }

    string baseS(ll x,int a){
        string ans;
        ll y;
        for (ll i=0;x>0;i++){
            y = x/a;
            ans += '0' + (x - y*a);
            x = y;
        }
        reverse(rng(ans));
        return ans;
    }
} math;

// .div.mul : div[i]、mul[i]はそれぞれiの約数、倍数を格納している。
// .div_init(n) : div,mulを初期化。引数はnまで。n < 1e6 ~ 1e7。
// .divisor(x) : xの約数列挙。xは64bit整数。
// .sqrt(x) : floor(sqrt(x))。xは64bit整数。誤差は発生しない。
// .logx(x , a) : floor(loga(x))。xは64bit整数。誤差は発生しない。
// .base(x , a) : x(10進数)をa進数表記に。1 <= a <= 10。戻り値はll型。 
// .baseS(x , a) : x(10進数)をa進数表記に。1 <= a <= 10。戻り値はstring型。 

int main(){
    ll k; cin>>k;

    vl cnt(19);

    cnt[0] = 1;

    map<int , ll> mp;

    mp[0] = 1;
    mp[4] = 1;
    mp[6] = 1;
    mp[9] = 1;
    mp[8] = 2;

    vl f(19);
    f[0] = 1;

    rep1(i,19) f[i] = f[i-1] * 10; 

    rep1(i,19){
        rep(j,i){
            if (j != 0) cnt[i] += cnt[j] * 9;
            if (j != 0) cnt[i] += mp[0] * (i - j - 1) * (f[j] - f[j-1]) * 9;
            else cnt[i] += mp[0] * (i - j - 1) * 9;
        }
        cnt[i] += f[i-1]*5;
    }

    auto output = [&](ll x) -> ll{

        ll ret = 0;

        string s = to_string(x);

        int l = sz(s);

        rep1(i,l) ret += cnt[i];

        rep(i,l){
            int a = s[i] -  '0';

            if (i == l-1){
                rep(j,a+1){
                    if (l == 1 && j == 0) continue;
                    if (mp.count(j)) ret += mp[j];
                }

                continue;
            }

            if (mp.count(a)){
                string t = s.substr(i+1 , l - i - 1);
                ll tmp = stol(t);
                ret += mp[a] * (tmp+1);
            }

            rep(j,a){
                if (i == 0 && j == 0) continue;
                rep(ii , l-i){
                    if (ii != l-i-1) ret += cnt[l - i - 1 - ii];
                    if (ii != l-i-1) ret += mp[0] * ii * (f[l - i - 1 - ii] - f[l - i - 1 - ii-1]);
                    else ret += mp[0] * ii * f[l - i - 1 - ii];
                }
                if (mp.count(j)){
                    ret += mp[j] * f[l - i - 1];
                }
            }
        }

        return ret;
        
    };

    ll sum2 = 0;

    // rep1(i,10000000){
    //     string s = to_string(i);
    //     fore(y , s) if (mp.count(y - '0')) sum2 += mp[y - '0'];

    //     if (output(i) != sum2){
    //         show(i);
    //         deb(output(i) , sum2);
    //         break;
    //     }
    // }

    ll l = 0 , u = (ll)1e18+1;

    while(u - l > 1){
        ll mid = (l + u) / 2;

        ll tmp = output(mid);

        if (tmp <= k) l = mid;
        else u = mid;
    }

    ll tmp = output(l);

    if (tmp != k){
        cout << -1 << endl;
    }else{
        cout << l << endl;
    }

    return 0;
}