CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:TrixterTheTux
Submission time:2019-10-04 16:04:48 +0300
Language:Python2 (PyPy2)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1--1, 2, 3details
#2--1, 2, 3details
#3ACCEPTED0.04 s1, 2, 3details
#4--1, 2, 3details
#5--1, 2, 3details
#6ACCEPTED0.08 s1, 2, 3details
#7--1, 2, 3details
#8--1, 2, 3details
#9--1, 2, 3details
#10--1, 2, 3details
#11ACCEPTED0.08 s1, 2, 3details
#12ACCEPTED0.04 s1, 2, 3details
#13ACCEPTED0.30 s2, 3details
#14--2, 3details
#15--2, 3details
#16--2, 3details
#17--2, 3details
#18ACCEPTED0.39 s2, 3details
#19--2, 3details
#20ACCEPTED0.04 s2, 3details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#27--3details
#28ACCEPTED0.26 s3details

Code

import itertools

cache = dict()
def get_products(len):
    if len in cache:
        return cache[len]

    products = itertools.product(['0', '1'], repeat=len)
    res = list(map(lambda x: int(''.join(x)), products))
    cache[len] = res
    return res

def decide_step(dist):
    for x in range(0, 17):
        if dist > pow(10, 18-x):
            return pow(10, x)

    return 1

def solve(a, b):
    str_len = len(str(b))
    products = get_products(str_len)
    products_len = len(products)

    biggest_num = pow(10, str_len) - 1
    dist_to_b = biggest_num - b

    try:
        startIndex = 0
        step = decide_step(a)
        while products[startIndex] < a:
            startIndex = min(products_len - 1, startIndex + step)
            step = decide_step(abs(a - products[startIndex]))

        while startIndex > 0 and products[startIndex] > a:
            startIndex -= 1

        if products[startIndex] < a:
            startIndex += 1

        endIndex = -1
        step = decide_step(dist_to_b)
        while products[endIndex] > b:
            endIndex = max(-products_len + 1, endIndex - step)
            step = decide_step(abs(b - products[endIndex]))
        
        while endIndex < 0 and products[endIndex] < b:
            endIndex += 1

        if endIndex == 0:
            endIndex -= 1

        return products_len + endIndex + 1 - startIndex
    except IndexError:
        return 0

count = int(raw_input())
for x in range(0, count):
    a, b = [int(x) for x in raw_input().split()]
    print(solve(a, b))

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
4
0 10
1 5
3 4
11 11

correct output
3
1
0
1

user output
(empty)

Test 2

Group: 1, 2, 3

Verdict:

input
1
0 0

correct output
1

user output
(empty)

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
1000 1000

correct output
1

user output
1

Test 4

Group: 1, 2, 3

Verdict:

input
16
0 0
0 1
0 2
1 1
...

correct output
1
2
2
1
1
...

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict:

input
9
0 0
0 1
0 10
0 11
...

correct output
1
2
3
4
5
...

user output
(empty)

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
1000
0 1000
0 1000
0 1000
0 1000
...

correct output
9
9
9
9
9
...

user output
9
9
9
9
9
...
Truncated

Test 7

Group: 1, 2, 3

Verdict:

input
1000
100 111
0 101
1 10
10 110
...

correct output
4
6
2
5
8
...

user output
(empty)

Test 8

Group: 1, 2, 3

Verdict:

input
1000
480 564
753 988
479 909
32 973
...

correct output
0
0
0
4
0
...

user output
(empty)

Test 9

Group: 1, 2, 3

Verdict:

input
1000
98 111
8 111
98 111
111 113
...

correct output
4
6
4
1
7
...

user output
(empty)

Test 10

Group: 1, 2, 3

Verdict:

input
1000
0 0
1 1
2 2
3 3
...

correct output
1
1
0
0
0
...

user output
(empty)

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
1000
0 1000
0 999
1 1000
0 998
...

correct output
9
8
8
8
7
...

user output
9
8
8
8
7
...
Truncated

Test 12

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
0 1000

correct output
9

user output
9

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
100000
0 100000
0 100000
0 100000
0 100000
...

correct output
33
33
33
33
33
...

user output
33
33
33
33
33
...
Truncated

Test 14

Group: 2, 3

Verdict:

input
100000
86042 98295
30077 80920
45856 67174
3890 60412
...

correct output
0
0
0
16
0
...

user output
(empty)

Test 15

Group: 2, 3

Verdict:

input
100000
11 10000
1111 11000
1011 1100
1110 1111
...

correct output
14
10
2
2
8
...

user output
(empty)

Test 16

Group: 2, 3

Verdict:

input
100000
9 9999
1109 1110
112 1012
11098 11101
...

correct output
14
1
4
2
6
...

user output
(empty)

Test 17

Group: 2, 3

Verdict:

input
100000
0 0
1 1
2 2
3 3
...

correct output
1
1
0
0
0
...

user output
(empty)

Test 18

Group: 2, 3

Verdict: ACCEPTED

input
100000
0 100000
0 99999
1 100000
0 99998
...

correct output
33
32
32
32
31
...

user output
33
32
32
32
31
...
Truncated

Test 19

Group: 2, 3

Verdict:

input
3
99999 99999
99999 100000
100000 100000

correct output
0
1
1

user output
(empty)

Test 20

Group: 2, 3

Verdict: ACCEPTED

input
1
0 100000

correct output
33

user output
33

Test 21

Group: 3

Verdict:

input
100000
0 1000000000000000000
0 1000000000000000000
0 1000000000000000000
0 1000000000000000000
...

correct output
262145
262145
262145
262145
262145
...

user output
(empty)

Test 22

Group: 3

Verdict:

input
100000
179926689319432205 25677963778...

correct output
0
0
0
0
0
...

user output
(empty)

Test 23

Group: 3

Verdict:

input
100000
100110100011010101 11100011010...

correct output
74822
54944
140968
252594
23521
...

user output
(empty)

Test 24

Group: 3

Verdict:

input
100000
100110100011010102 11100011010...

correct output
74822
252594
94086
10836
11352
...

user output
(empty)

Test 25

Group: 3

Verdict:

input
100000
256779637786129463 25677963778...

correct output
0
0
0
0
0
...

user output
(empty)

Test 26

Group: 3

Verdict:

input
100000
0 1000000000000000000
0 999999999999999999
1 1000000000000000000
0 999999999999999998
...

correct output
262145
262144
262144
262144
262143
...

user output
(empty)

Test 27

Group: 3

Verdict:

input
3
999999999999999999 99999999999...

correct output
0
1
1

user output
(empty)

Test 28

Group: 3

Verdict: ACCEPTED

input
1
0 1000000000000000000

correct output
262145

user output
262145