CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	2021-luvut
Sender:	nikolai2001
Submission time:	2020-10-03 19:46:42 +0300
Language:	C++ (C++17)
Status:	READY
Result:	25

Feedback
group	verdict	score
#1	ACCEPTED	10
#2	ACCEPTED	15
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3, 4	details
#2	ACCEPTED	0.01 s	1, 2, 3, 4	details
#3	ACCEPTED	0.01 s	1, 2, 3, 4	details
#4	ACCEPTED	0.01 s	1, 2, 3, 4	details
#5	ACCEPTED	0.01 s	1, 2, 3, 4	details
#6	ACCEPTED	0.01 s	1, 2, 3, 4	details
#7	ACCEPTED	0.01 s	1, 2, 3, 4	details
#8	ACCEPTED	0.01 s	1, 2, 3, 4	details
#9	ACCEPTED	0.01 s	1, 2, 3, 4	details
#10	ACCEPTED	0.01 s	1, 2, 3, 4	details
#11	ACCEPTED	0.01 s	2, 3, 4	details
#12	ACCEPTED	0.01 s	2, 3, 4	details
#13	ACCEPTED	0.01 s	2, 3, 4	details
#14	ACCEPTED	0.01 s	2, 3, 4	details
#15	ACCEPTED	0.01 s	2, 3, 4	details
#16	ACCEPTED	0.01 s	2, 3, 4	details
#17	ACCEPTED	0.01 s	2, 3, 4	details
#18	ACCEPTED	0.01 s	2, 3, 4	details
#19	ACCEPTED	0.01 s	2, 3, 4	details
#20	ACCEPTED	0.01 s	2, 3, 4	details
#21	WRONG ANSWER	0.01 s	3, 4	details
#22	WRONG ANSWER	0.01 s	3, 4	details
#23	WRONG ANSWER	0.01 s	3, 4	details
#24	WRONG ANSWER	0.01 s	3, 4	details
#25	WRONG ANSWER	0.01 s	3, 4	details
#26	WRONG ANSWER	0.01 s	3, 4	details
#27	WRONG ANSWER	0.01 s	3, 4	details
#28	WRONG ANSWER	0.01 s	3, 4	details
#29	WRONG ANSWER	0.01 s	3, 4	details
#30	WRONG ANSWER	0.01 s	3, 4	details
#31	WRONG ANSWER	0.01 s	4	details
#32	WRONG ANSWER	0.01 s	4	details
#33	WRONG ANSWER	0.01 s	4	details
#34	WRONG ANSWER	0.01 s	4	details
#35	WRONG ANSWER	0.01 s	4	details
#36	WRONG ANSWER	0.01 s	4	details
#37	WRONG ANSWER	0.01 s	4	details
#38	WRONG ANSWER	0.01 s	4	details
#39	WRONG ANSWER	0.01 s	4	details
#40	WRONG ANSWER	0.01 s	4	details

Code

#include<bits/stdc++.h>

using namespace std;

// 0 - [n-1]
int wantedIndex;

void printBCD(uint64_t bcd){
    char buf[17];
    char *c = buf + 16;
    do{
        *--c = '0' + (bcd & 0x0F);
        bcd >>= 4;
    }while(bcd > 0L);

    buf[16] = '\0';

    puts(c);
}

[[ noreturn ]] void returnBCD(uint64_t bcd) {
    printBCD(bcd);

    exit(EXIT_SUCCESS);
}

uint64_t bcd(uint64_t n){
    int ret = 0;
    int sh = 0;
    while(n > 0){
        ret += (n % 10) << sh;
        n /= 10;
        sh += 4;
    }

    return ret;
}

uint64_t get1f(uint64_t prefix, uint64_t number, int nWidth){
    int nnumbers = (nWidth >> 2) * 9 + 10;

    if(wantedIndex >= nnumbers) return nnumbers;

    if(nWidth == 0){
        returnBCD(prefix << 4 | wantedIndex);
    }else{
        //int i = 0;
        
        char msd = number >> (nWidth - 4);

        if(msd > wantedIndex)
            returnBCD(prefix << 4 | wantedIndex << nWidth | number);
        
        wantedIndex -= msd;

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;
        int pp = (prefix | number) & ~nMask;
        wantedIndex -= get1f( pp, number & nMask, nW);


        int i = msd + 1 + wantedIndex;
        assert(i < 10);
        returnBCD(prefix << 4 | i << nWidth | number);
    }
}

uint64_t get2f(uint64_t prefix, uint64_t number, int nWidth){
    int nnumbers = 100;
    if(nWidth >= 16) nnumbers = 1270;
    else if(nWidth >= 12) nnumbers = 856;
    else if(nWidth >= 8) nnumbers = 523;
    else if(nWidth >= 4) nnumbers = 271;

    if(wantedIndex >= nnumbers) return nnumbers;

    if(nWidth == 0){
        returnBCD(prefix << 8 | bcd(wantedIndex) );
    }else{
        int i = 0;
        
        char msd = number >> (nWidth - 4);

        while(i < msd)
            wantedIndex -= get1f(prefix << 4 | i++ << nWidth, number, nWidth);

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;

        wantedIndex -= get2f(prefix | msd << nW, number & nMask, nW);

        i++;
        while(i < 10)
            wantedIndex -= get1f(prefix << 4 | i++ << nWidth, number, nWidth);
    }

    throw "Should not return get2f";
}

uint64_t get3f(uint64_t prefix, uint64_t number, int nWidth){
    int nnumbers = 1000;
    if(nWidth >= 16) nnumbers = 27280;
    else if(nWidth >= 12) nnumbers = 15850;
    else if(nWidth >= 8) nnumbers = 8146;
    else if(nWidth >= 4) nnumbers = 3439;

    if(wantedIndex >= nnumbers) return nnumbers;

    if(nWidth == 0){
        returnBCD(prefix << 12 | bcd(wantedIndex) );
    }else{
        int i = 0;
        
        char msd = number >> (nWidth - 4);

        while(i < msd)
            wantedIndex -= get2f(prefix << 4 | i++ << nWidth, number, nWidth);

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;

        wantedIndex -= get3f(prefix | msd << nW, number & nMask, nW);

        i++;
        while(i < 10)
            wantedIndex -= get2f(prefix << 4 | i++ << nWidth, number, nWidth);
    }

    throw "Should not return get3f";
}

uint64_t get4f(uint64_t prefix, uint64_t number, int nWidth){
    int nnumbers = 10000;
    if(nWidth >= 16) nnumbers = 502435;
    else if(nWidth >= 12) nnumbers = 256915;
    else if(nWidth >= 8) nnumbers = 114265;
    else if(nWidth >= 4) nnumbers = 40951;

    if(wantedIndex >= nnumbers) return nnumbers;

    if(nWidth == 0){
        returnBCD(prefix << 4 | bcd(wantedIndex) );
    }else{
        int i = 0;
        
        char msd = number >> (nWidth - 4);

        while(i < msd)
            wantedIndex -= get3f(prefix << 4 | i++ << nWidth, number, nWidth);

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;

        wantedIndex -= get4f(prefix | msd << nW, number & nMask, nW);

        i++;
        while(i < 10)
            wantedIndex -= get3f(prefix << 4 | i++ << nWidth, number, nWidth);
    }

    throw "Should not return get4f";
}

uint64_t get5f(uint64_t prefix, uint64_t number, int nWidth){
    int nnumbers = 100000;
    if(nWidth >= 16) nnumbers = 8331094;
    else if(nWidth >= 12) nnumbers = 3809179;
    else if(nWidth >= 8) nnumbers = 1496944;
    else if(nWidth >= 4) nnumbers = 468559;

    if(wantedIndex >= nnumbers) return nnumbers;

    if(nWidth == 0){
        returnBCD(prefix << 16 | bcd(wantedIndex) );
    }else{
        int i = 0;
        
        char msd = number >> (nWidth - 4);

        while(i < msd)
            wantedIndex -= get4f(prefix << 4 | i++ << nWidth, number, nWidth);

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;

        wantedIndex -= get5f(prefix | msd << nW, number & nMask, nW);

        i++;
        while(i < 10)
            wantedIndex -= get4f(prefix << 4 | i++ << nWidth, number, nWidth);
    }

    throw "Should not return get5f";
}


uint64_t get1(uint64_t prefix, uint64_t number, int nWidth){
    int i = 0;

    uint64_t n = 0;

    if(nWidth != 0){
        char msd = number >> (nWidth - 4);

        while(i < msd){
            printBCD(prefix << 4 | i << nWidth | number);
            i++;
            n++;
        }

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;
        int pp = (prefix | number) & ~nMask;

        n += get1( pp, number & nMask, nW);

        i++;
        while(i < 10){
            printBCD(prefix << 4 | i << nWidth | number);
            i++;
            n++;
        }
    }else{
        while(i < 10){
            printBCD(prefix << 4 | i);
            i++;
            n++;
        }
    }

    //printf("Get1 (%d): %lu\n", nWidth, n);

    return n;
}

uint64_t get2(uint64_t prefix, uint64_t number, int nWidth){
    int i = 0;

    uint64_t n = 0;

    if(nWidth > 0){

        // Most significant digit
        char msd = number >> (nWidth - 4);

        while(i < msd){
            n += get1(prefix << 4 | i << nWidth, number, nWidth);
            i++;
        }

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;

        n += get2(prefix | msd << nW, number & nMask, nW);

        i++;
        while(i < 10){
            n += get1(prefix << 4 | i << nWidth, number, nWidth);
            i++;
        }

    }else{
        i = 0;
        while(1){
            printBCD(prefix << 8 | i);
            if( (++i & 0x0F) <= 9){
                continue;
            }

            i+= 0x10 - 10;
            if(i >= 0xA0) break;
        }
        n+= 100;
    }

    //printf("Get2 (%d): %lu\n", nWidth, n);
    return n;
}

uint64_t get3(uint64_t prefix, uint64_t number, int nWidth){
    int i = 0;

    uint64_t n = 0;

    if(nWidth > 0){

        // Most significant digit
        char msd = number >> (nWidth - 4);

        while(i < msd){
            wantedIndex = 0xFFFFFFF;
            n += get2(prefix << 4 | i << nWidth, number, nWidth);
            i++;
        }

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;

        n += get3(prefix | msd << nW, number & nMask, nW);

        i++;
        while(i < 10){
            wantedIndex = 0xFFFFFFF;
            n += get2(prefix << 4 | i << nWidth, number, nWidth);
            i++;
        }

    }else{
        i = 0;
        while(1){
            printBCD(prefix << 12 | i);
            if( (++i & 0x0F) <= 9){
                continue;
            }

            i+= 0x10 - 10;
            if( (i & 0xFF) < 0xA0) continue;
            i+= 0x100 - 0xA0;
            if(i >= 0xA00) break;
        }
        n+= 1000;
    }
    //printf("Get3 (%d): %lu\n", nWidth, n);
    return n;
}

int depth = 1;

uint64_t get4(uint64_t prefix, uint64_t number, int nWidth){
    int i = 0;

    uint64_t n = 0;

    if(nWidth > 0){

        // Most significant digit
        char msd = number >> (nWidth - 4);

        while(i < msd){
            n += get3(prefix << 4 | i << nWidth, number, nWidth);
            i++;
        }

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;

        depth++;
        n += get4(prefix | msd << nW, number & nMask, nW);
        depth--;

        i++;
        while(i < 10){
            n += get3(prefix << 4 | i << nWidth, number, nWidth);
            i++;
        }

    }else{
        i = 0;
        while(1){
            printBCD(prefix << 16 | i);
            if( (++i & 0x0F) <= 9){
                continue;
            }

            i+= 0x10 - 10;
            if( (i & 0xFF) < 0xA0) continue;
            i+= 0x100 - 0xA0;
            if( (i & 0xFFF) < 0xA00) continue;
            i+= 0x1000 - 0xA00;
            if(i >= 0xA000) break;
        }
        n+= 10000;
    }
    //printf("Get4 (%d): %lu\n", nWidth, n);
    return n;
}

uint64_t get5(uint64_t prefix, uint64_t number, int nWidth){
    int i = 0;

    uint64_t n = 0;

    if(nWidth > 0){

        // Most significant digit
        char msd = number >> (nWidth - 4);

        while(i < msd){
            n += get4(prefix << 4 | i << nWidth, number, nWidth);
            i++;
        }

        int nW = nWidth - 4;
        int nMask = (1 << nW) - 1;

        n += get5(prefix | msd << nW, number & nMask, nW);

        i++;
        while(i < 10){
            n += get4(prefix << 4 | i << nWidth, number, nWidth);
            i++;
        }

    }else{
        i = 0;
        while(1){
            printBCD(prefix << 16 | i);
            if( (++i & 0x0F) <= 9){
                continue;
            }

            i+= 0x10 - 10;
            if( (i & 0xFF) < 0xA0) continue;
            i+= 0x100 - 0xA0;
            if( (i & 0xFFF) < 0xA00) continue;
            i+= 0x1000 - 0xA00;
            if(i >= 0xA000) break;
        }
        n+= 100000;
    }
    //printf("Get5 (%d): %lu\n", nWidth, n);
    return n;
}

int main(int argc, char *argv[]){
    if(argc < 2){
        cin >> wantedIndex;
        
    }else wantedIndex = atoi(argv[1]);

    wantedIndex--;

    //get1(0, 0x2021, 16, false);

    /*const char str[] = "2021";
    puts(str);*/

    get5f(0, 0x2021, 16);

    //get2f(0, 0x2021, 16);
}

Test details

Test 1

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`10` view save

correct output
`20214` view save

user output
`20214` view save

Test 2

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`359` view save

correct output
`202661` view save

user output
`202661` view save

Test 3

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`392` view save

correct output
`202819` view save

user output
`202819` view save

Test 4

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`715` view save

correct output
`230721` view save

user output
`230721` view save

Test 5

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`278` view save

correct output
`202219` view save

user output
`202219` view save

Test 6

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`296` view save

correct output
`202318` view save

user output
`202318` view save

Test 7

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`427` view save

correct output
`203214` view save

user output
`203214` view save

Test 8

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`565` view save

correct output
`208212` view save

user output
`208212` view save

Test 9

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`289` view save

correct output
`202311` view save

user output
`202311` view save

Test 10

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
`342` view save

correct output
`202581` view save

user output
`202581` view save

Test 11

Group: 2, 3, 4

Verdict: ACCEPTED

input
`964486` view save

correct output
`182502018` view save

user output
`182502018` view save

Test 12

Group: 2, 3, 4

Verdict: ACCEPTED

input
`110979` view save

correct output
`20296916` view save

user output
`20296916` view save

Test 13

Group: 2, 3, 4

Verdict: ACCEPTED

input
`759149` view save

correct output
`126108721` view save

user output
`126108721` view save

Test 14

Group: 2, 3, 4

Verdict: ACCEPTED

input
`234934` view save

correct output
`25023210` view save

user output
`25023210` view save

Test 15

Group: 2, 3, 4

Verdict: ACCEPTED

input
`610310` view save

correct output
`120288133` view save

user output
`120288133` view save

Test 16

Group: 2, 3, 4

Verdict: ACCEPTED

input
`956690` view save

correct output
`182027419` view save

user output
`182027419` view save

Test 17

Group: 2, 3, 4

Verdict: ACCEPTED

input
`608459` view save

correct output
`120281827` view save

user output
`120281827` view save

Test 18

Group: 2, 3, 4

Verdict: ACCEPTED

input
`944777` view save

correct output
`175260251` view save

user output
`175260251` view save

Test 19

Group: 2, 3, 4

Verdict: ACCEPTED

input
`880780` view save

correct output
`152270421` view save

user output
`152270421` view save

Test 20

Group: 2, 3, 4

Verdict: ACCEPTED

input
`418357` view save

correct output
`68202361` view save

user output
`68202361` view save

Test 21

Group: 3, 4

Verdict: WRONG ANSWER

input
`713294506861` view save

correct output
`20099206371786` view save

user output
(empty)

Test 22

Group: 3, 4

Verdict: WRONG ANSWER

input
`191431126351` view save

correct output
`4193020274761` view save

user output
(empty)

Test 23

Group: 3, 4

Verdict: WRONG ANSWER

input
`778422318223` view save

correct output
`20247733120134` view save

user output
(empty)

Test 24

Group: 3, 4

Verdict: WRONG ANSWER

input
`931090767075` view save

correct output
`20691282041612` view save

user output
(empty)

Test 25

Group: 3, 4

Verdict: WRONG ANSWER

input
`198806129726` view save

correct output
`4275365802196` view save

user output
(empty)

Test 26

Group: 3, 4

Verdict: WRONG ANSWER

input
`724343399444` view save

correct output
`20128443204610` view save

user output
(empty)

Test 27

Group: 3, 4

Verdict: WRONG ANSWER

input
`105064053560` view save

correct output
`2350677231115` view save

user output
(empty)

Test 28

Group: 3, 4

Verdict: WRONG ANSWER

input
`236866700902` view save

correct output
`5872395029521` view save

user output
(empty)

Test 29

Group: 3, 4

Verdict: WRONG ANSWER

input
`696349488695` view save

correct output
`20034225603103` view save

user output
(empty)

Test 30

Group: 3, 4

Verdict: WRONG ANSWER

input
`30929267826` view save

correct output
`1205256095901` view save

user output
(empty)

Test 31

Group: 4

Verdict: WRONG ANSWER

input
`576379198814226780` view save

correct output
`4185251600926331891` view save

user output
(empty)

Test 32

Group: 4

Verdict: WRONG ANSWER

input
`291698664446913099` view save

correct output
`2280132983584730156` view save

user output
(empty)

Test 33

Group: 4

Verdict: WRONG ANSWER

input
`693146378550043345` view save

correct output
`5270258230724009910` view save

user output
(empty)

Test 34

Group: 4

Verdict: WRONG ANSWER

input
`685982323362439932` view save

correct output
`5236052744416920782` view save

user output
(empty)

Test 35

Group: 4

Verdict: WRONG ANSWER

input
`838865925103308874` view save

correct output
`6800200426815679149` view save

user output
(empty)

Test 36

Group: 4

Verdict: WRONG ANSWER

input
`766426223219980635` view save

correct output
`6112960212822572807` view save

user output
(empty)

Test 37

Group: 4

Verdict: WRONG ANSWER

input
`652970397451919317` view save

correct output
`4923188580186259818` view save

user output
(empty)

Test 38

Group: 4

Verdict: WRONG ANSWER

input
`188458586650539464` view save

correct output
`1903508375720755921` view save

user output
(empty)

Test 39

Group: 4

Verdict: WRONG ANSWER

input
`157646989818721527` view save

correct output
`1525038392797601315` view save

user output
(empty)

Test 40

Group: 4

Verdict: WRONG ANSWER

input
`898606361978236778` view save

correct output
`7326676702587314407` view save

user output
(empty)

Datatähti 2021 alku

2021-luvut

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Tasks

Submissions (nikolai2001)