CSES - Putka Open 2020 – 3/5 - Results
Submission details
Task:Numerot
Sender:Lieska
Submission time:2020-10-18 20:04:30 +0300
Language:C++17
Status:READY
Result:25
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED13
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.07 s2, 3details
#30.59 s3details

Code

#include <bits/stdc++.h>
using namespace std;

typedef __int128_t ll;
//typedef long long ll;

ll l[22][10], r[22][10][10], v[22][10][10], vas[111], ky[22], ysi[22], ra[22][10][10][20], va[22][10][10][10];
int x, x1;

map<ll, ll> ma;

ll f(ll a){
    int b=1;
    while ((a/ky[b])%10==9) b++;
    //cout << "tasa " << b << " " << ky[b] << " " << (a/ky[b]) << " " << (a/ky[b])%10 << " " << a <<"\n";
    x1=(a/ky[b])%10;
    int c=0;
    for (int i=max(b+1,2); i<=20; ++i){
        c = max(c, (int)(a/ky[i])%10);
    }
    x=c;
    return b;
}

ll askeleet(ll a){
    //cout << a << " a\n";
    if (ma[a]) return ma[a];
    if (a<100){
        return vas[a];
    }
    ll a1=a;
    ll a2=f(a);
    ll c=a%(100), ans=0;
    if (a2>2) x=9;
    if (a2==2) x=max(x, x1);
    //cout << a << " " << x << " " << x1 << " " << ans << " " << c << " " << a2 << "\n";
    while (c>=0){
        int d=c%10, e=(c/10)%10;
        c = c - max(x, max(d, e));
        ans++;
    }
    a = (a/100)*100 + c;
    int viim=a%10;
    //cout << a << " " << viim << " " << ans << "\n";
    while (true){
        ll b=f(a);
        if (x==0 && x1==0) break;
        if (x==0){
            ans = ans + r[b][x1][viim];
            a = (a/ky[b]-1)*ky[b] + ysi[b] + v[b][x1][viim];
            viim=a%10;
        }
        else{
            ans = ans + ra[b][x][x1][viim];
            a = (a/ky[b+1]-1)*ky[b+1] + ysi[b+1] + va[b][x][x1][viim];
            viim=a%10;
        }
        //cout << a << " " << b << " " << x << " " << x1 << " " << ans << " " << viim << " " << ysi[b] << " " << v[b][x1][viim] << " \n";
    }
    //cout << a << " " << viim << " " << ans << "\n";
    ll b=f(a);
    ans+=l[b][viim];
    //cout << a << " " << b << " " << viim << " " << l[b][viim] << " " << ans << "\n";
    ma[a1]=ans;
    return ans;
}


int main(){
    int t;
    cin >> t;
    ky[0]=1;
    ysi[2]=90;
    for (int i=1; i<=20; ++i) ky[i]=ky[i-1]*10;
    for (int i=3; i<=20; ++i) ysi[i] = 9*ky[i-1]+ysi[i-1];
    for (int i=1; i<=100; ++i){
        int a=0;
        a = max(a, i%10);
        a = max(a, (i/10)%10);
        vas[i]=vas[i-a]+1;
    }
    l[2][1]=l[2][2]=l[2][3]=15;
    for (int i=4; i<=9; ++i) l[2][i]=16;
    for (int k=1; k<=9; ++k){
        for (int j=1; j<=9; ++j){
            int a=90+j;
            int b=0;
            while (a>=0){
                int d=a%10, e=(a/10)%10;
                a = a - max(k, max(d, e));
                b++;
            }
            a+=10;
            r[2][k][j]=b;
            v[2][k][j]=a;
        }
    }
    for (int i=3; i<=20; ++i){
        for (int k=1; k<=9; ++k){
            for (int j=1; j<=9; ++j){
                ll a=0, b=j;
                for (int m=9; m>=0; --m){
                    int c=max(k, m);
                    a+=r[i-1][c][b];
                    b = v[i-1][c][b];
                }
                r[i][k][j]=a;
                v[i][k][j]=b;
            }
        }
    }
    for (int i=3; i<=20; ++i){
        for (int j=1; j<=9; ++j){
            ll a=0, b=j;
            for (int m=9; m>=1; --m){
                a+=r[i-1][m][b];
                b=v[i-1][m][b];
            }
            a+=l[i-1][b];
            l[i][j]=a;
        }
    }
    for (int i=2; i<=20; ++i){
        for (int k=1; k<=9; ++k){
            for (int l=0; l<=8; ++l){
                if (k==0 && l==0) continue;
                for (int j=1; j<=9; ++j){
                    ll a=0, b=j;
                    for (int m=l; m>=0; --m){
                        a+=r[i][max(k, m)][b];
                        b =v[i][max(k, m)][b];
                    }
                    ra[i][k][l][j]=a;
                    va[i][k][l][j]=b;
                }
            }
        }
    }
    while (t--){
        ll y;
        long long y1;
        cin >> y1;
        y=y1;
        if (y==1) {
            cout << "1\n";
            continue;
        }
        ll a=1;
        while (askeleet(a*2)<y){
            a*=2;
        }
        ll b=a;
        while (a>=1){
            if (askeleet(b+a)<y) b = b+a;
            a/=2;
        }
        ll b1=(b+1)/100, b2=(b+1)%100;
        if (b1!=0) cout << (long long)b1;
        if (b2<10) cout << "0";
        cout << (long long)b2 << "\n";
    }
}


Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
1000
1
2
3
4
...

correct output
1
10
11
20
22
...

user output
1
10
11
20
22
...

Test 2

Group: 2, 3

Verdict: ACCEPTED

input
1000
224995
413660
249827
2125
...

correct output
1731724
3216040
1940719
14585
532612
...

user output
1731724
3216040
1940719
14585
532612
...

Test 3

Group: 3

Verdict:

input
1000
627887018110416188
785474884983906653
653772166720939773
784335285960673683
...

correct output
5530371754830260284
6918696171534226533
5757755627065159149
6908439780325129803
3223801064342340738
...

user output
5530371754843583321
6918696171534226533
5757755627065159124
6908439780325129803
3223801064342340738
...