CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:Guuber
Submission time:2020-10-01 19:11:19 +0300
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s1, 2details
#30.01 s1, 2details
#40.01 s1, 2details
#50.01 s1, 2details
#60.01 s1, 2details
#70.01 s1, 2details
#80.01 s1, 2details
#90.01 s1, 2details
#100.01 s1, 2details
#110.01 s2details
#120.01 s2details
#130.01 s2details
#140.01 s2details
#150.01 s2details
#160.01 s2details
#170.01 s2details
#180.01 s2details
#190.01 s2details
#200.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details
#250.01 s2details
#260.01 s2details
#270.01 s2details
#280.01 s2details
#290.01 s2details
#300.01 s2details
#310.01 s1, 2details

Compiler report

input/code.cpp: In function 'std::__cxx11::string recursion0(ll, int)':
input/code.cpp:13:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(s.size() <= kohta){
               ~~~~~~~~~^~~~~~~~

Code

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

ll n;
ll dp[101010];
ll dp2[101010];
ll dp3[1010101];
ll kp[101010];
ll dp4[1010101];
string recursion0(ll number, int kohta){
        string s = to_string(number-1);
        while(s.size() <= kohta){
                s = '0'+s;
        }
        return s;
}

string recursion1(ll number, int kohta){
        if(kohta == 0){
                return "1";     
        }
        if(number == 1){
                string s = "";
                for(ll i = 0; i <= kohta; i++){
                        s += '0';       
                }
                s[s.size()-1] = '1';
                return s;
        }

        if(number < dp[kohta] + 1){
                        return '0' + recursion1(number, kohta-1);
        }
        number -= dp[kohta];
        if(number < kp[kohta]+1){
                        return '1' + recursion0(number, kohta-1);
        }
        number -= kp[kohta];
        for(ll co = 2; co < 9; co++){
                if(number < dp[kohta] + 1){
                        return char('0'+co) + recursion1(number, kohta-1);
                }
                number -= dp[kohta];   
        }
        return '9' + recursion1(number, kohta-1);
}

string recursion2(ll number, int kohta){
        if(number == 1){
                if(kohta <= 1){
                        return "21";
                }
                string s = "";
                for(ll i = 0; i <= kohta; i++){
                        s += '0';
                }
                s[s.size()-1] = '1';
                s[s.size()-2] = '2';
                return s;
        }
        if(number < dp2[kohta] + 1){
                return '0' + recursion2(number, kohta-1);
        }
        number -= dp2[kohta];
        if(number < dp2[kohta] + 1){
                return '1' + recursion2(number, kohta-1);
        }
        number -= dp2[kohta];
        if(number < dp[kohta] + 1){
                return '2' + recursion1(number, kohta-1);
        }
        number -= dp[kohta];

        for(ll co = 3; co < 9; co++){
                if(number < dp2[kohta] + 1){
                        return char('0'+co) + recursion2(number, kohta-1);
                }
                number -= dp2[kohta];
        }
        return '9' + recursion2(number, kohta-1);
}

string recursion3(ll number, int kohta){
        if(number == 1){
                if(kohta <= 2){
                        return "021";
                }
                string s = "";
                for(int i = 0; i <= kohta; i++){
                        s += "0";
                }
                s[s.size()-1] = '1';
                s[s.size()-2] = '2';
                s[s.size()-3] = '0';
                return s;
        }

        if(number < dp2[kohta] + 1){
                return '0' + recursion2(number, kohta-1);
        }
        number -= dp2[kohta];

        for(int co = 1; co < 9; co++){
                if(number < dp3[kohta] + 1){
                        return char('0' + co) + recursion3(number, kohta-1);
                }
                number -= dp3[kohta];
        }
        return '9' + recursion3(number, kohta-1);
}

string recursion4(ll number, int kohta){
        if(number == 1){
                if(kohta <= 3){
                        return "2021";
                }
                string s = "";
                for(int i = 0; i <= kohta; i++){
                        s += "0";
                }
                s[s.size()-1]  = '1';
                s[s.size()-2] = '2';
                s[s.size()-3] = '0';
                s[s.size()-4] = '2';
                return s;
        }

        if(number < dp4[kohta] + 1){
                return '0' + recursion4(number, kohta-1);
        }
        number -= dp4[kohta];
        if(number < dp4[kohta] + 1){
                return '1' + recursion4(number, kohta-1);
        }

        number -= dp4[kohta];
        if(number < dp3[kohta] + 1){
                return '2' + recursion3(number, kohta-1);
        }
        number -= dp3[kohta];

        for(ll co = 3; co < 9; co++){
                if(number < dp4[kohta] + 1){
                        return char('0'+co) + recursion4(number, kohta-1);
                }
                number -= dp4[kohta];
        }
        return '9' + recursion4(number, kohta-1);
}

int main(){
        cin >> n;
        dp[1] = 1; kp[0] = 1;
        kp[1] = 10;
        ll counter = 10;
        for(ll i = 2; i < 20; i++){
                dp[i] = dp[i-1]*9 + counter;
                counter *= 10;
                kp[i] = counter;
        }

        dp2[2] = 1;
        for(ll i = 3; i < 20; i++){
                dp2[i] = dp2[i-1]*9 + dp[i-1];
        }

        dp3[3] = 1;
        for(ll i = 4; i < 20; i++){
                dp3[i] = dp3[i-1]*9 + dp2[i-1];
        }

        dp4[4] = 1;
        for(ll i = 5; i < 20; i++){
                dp4[i] = dp4[i-1]*9 + dp3[i-1];
        }

        int loppu = 0; 
        for(ll i = 1; dp4[i]+1 <= n; i++){
                if(dp4[i+1]+1 > n) {loppu = i; break;}
        }
        cout << recursion4(n, loppu);
}

Test details

Test 1

Group: 1, 2

Verdict:

input
3
165..
.4...
.3...
.2...
...

correct output
3
-
1

user output
20021

Test 2

Group: 1, 2

Verdict:

input
5
264..
.5...
.3...
.1...
...

correct output
3
4 5
1
2 5
2 4

user output
20201

Test 3

Group: 1, 2

Verdict:

input
5
152..
.4...
.3...
.6...
...

correct output
3 5
4
1 5
2
1 3

user output
20201

Test 4

Group: 1, 2

Verdict:

input
5
142..
.6...
.3...
.5...
...

correct output
4 5
3
2
1 5
1 4

user output
20201

Test 5

Group: 1, 2

Verdict:

input
5
123..
.4...
.6...
.5...
...

correct output
3
4 5
1
2 5
2 4

user output
20201

Test 6

Group: 1, 2

Verdict:

input
5
213..
.6...
.4...
.5...
...

correct output
4 5
3
2
1 5
1 4

user output
20201

Test 7

Group: 1, 2

Verdict:

input
5
314..
.5...
.2...
.6...
...

correct output
3
4 5
1
2 5
2 4

user output
20201

Test 8

Group: 1, 2

Verdict:

input
5
163..
.2...
.5...
.4...
...

correct output
4 5
3
2
1 5
1 4

user output
20201

Test 9

Group: 1, 2

Verdict:

input
5
264..
.1...
.3...
.5...
...

correct output
2 3
1 3
1 2
5
4

user output
20201

Test 10

Group: 1, 2

Verdict:

input
5
214..
.3...
.5...
.6...
...

correct output
5
3 4
2 4
2 3
1

user output
20201

Test 11

Group: 2

Verdict:

input
10
.41..
.5...
.2...
36...
...

correct output
9
4 6 8
7 10
2 6 8
-
...

user output
20214

Test 12

Group: 2

Verdict:

input
10
5....
1436.
.2...
.....
...

correct output
5 8
6 10
4 7 9
3 7 9
1 8
...

user output
20214

Test 13

Group: 2

Verdict:

input
10
2....
41...
.63..
.5...
...

correct output
4 9 10
5 6 7 8
-
1 9 10
2 6 7 8
...

user output
20214

Test 14

Group: 2

Verdict:

input
10
1....
634..
..52.
.....
...

correct output
2 3 4 5 6 9 10
1 3 4 5 6 9 10
1 2 4 5 6 9 10
1 2 3 5 6 9 10
1 2 3 4 6 9 10
...

user output
20214

Test 15

Group: 2

Verdict:

input
10
.2...
4516.
3....
.....
...

correct output
5 7 9 10
8
4 6
3 6
1 7 9 10
...

user output
20214

Test 16

Group: 2

Verdict:

input
10
.56..
.2...
.4...
31...
...

correct output
4 9
3 5 10
2 5 10
1 9
2 3 10
...

user output
20214

Test 17

Group: 2

Verdict:

input
10
..62.
.31..
45...
.....
...

correct output
2 3 4 8
1 3 4 8
1 2 4 8
1 2 3 8
6 7 9 10
...

user output
20214

Test 18

Group: 2

Verdict:

input
10
532..
.4...
.1...
.6...
...

correct output
3 8 9
5 6
1 8 9
7 10
2 6
...

user output
20214

Test 19

Group: 2

Verdict:

input
10
.64..
.1...
.3...
52...
...

correct output
2 5 6 7 8 9
1 5 6 7 8 9
4 10
3 10
1 2 6 7 8 9
...

user output
20214

Test 20

Group: 2

Verdict:

input
10
.4...
326..
.1...
.5...
...

correct output
4 7 8
6 9 10
5
1 7 8
3
...

user output
20214

Test 21

Group: 2

Verdict:

input
20
.6...
.4...
31...
.25..
...

correct output
3 7 11 16
6
1 7 11 16
5 19
4 19
...

user output
20261

Test 22

Group: 2

Verdict:

input
20
3....
5614.
..2..
.....
...

correct output
7 10 11 17 20
12
4 9 13 15 18
3 9 13 15 18
8 14 16
...

user output
20261

Test 23

Group: 2

Verdict:

input
20
42...
.316.
.5...
.....
...

correct output
5 12 13 15 18
16 20
6 8 14
9 19
1 12 13 15 18
...

user output
20261

Test 24

Group: 2

Verdict:

input
20
..5..
.623.
41...
.....
...

correct output
2 6 11 12 13
1 6 11 12 13
5 16 18
7 14
3 16 18
...

user output
20261

Test 25

Group: 2

Verdict:

input
20
.46..
53...
.1...
.2...
...

correct output
2 3 5 7 15 17 19
1 3 5 7 15 17 19
1 2 5 7 15 17 19
8 10 11 14
1 2 3 7 15 17 19
...

user output
20261

Test 26

Group: 2

Verdict:

input
20
.61..
.4...
35...
.2...
...

correct output
8 10 20
3 17 18 19
2 17 18 19
14 15
6 7 9 13
...

user output
20261

Test 27

Group: 2

Verdict:

input
20
..2..
1463.
.5...
.....
...

correct output
2 3 5 6 9 20
1 3 5 6 9 20
1 2 5 6 9 20
11 19
1 2 3 6 9 20
...

user output
20261

Test 28

Group: 2

Verdict:

input
20
...4.
5132.
6....
.....
...

correct output
2 8 10 12 13 19
1 8 10 12 13 19
4 5 15 16 17
3 5 15 16 17
3 4 15 16 17
...

user output
20261

Test 29

Group: 2

Verdict:

input
20
.2...
.31..
45...
6....
...

correct output
5 8 9 14 17
3 10 16
2 10 16
13 15 19
1 8 9 14 17
...

user output
20261

Test 30

Group: 2

Verdict:

input
20
3....
452..
.1...
.6...
...

correct output
3 7 8 9 14 15 16 19
4 12 13 17
1 7 8 9 14 15 16 19
2 12 13 17
11 20
...

user output
20261

Test 31

Group: 1, 2

Verdict:

input
2
546..
.3...
.2...
.1...
...

correct output
-
-

user output
12021