CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:TrixterTheTux
Submission time:2019-10-04 17:28:51 +0300
Language:PyPy2
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.04 s1, 2, 3details
#20.04 s1, 2, 3details
#30.04 s1, 2, 3details
#40.04 s1, 2, 3details
#50.04 s1, 2, 3details
#60.07 s1, 2, 3details
#70.08 s1, 2, 3details
#80.07 s1, 2, 3details
#90.09 s1, 2, 3details
#100.07 s1, 2, 3details
#110.09 s1, 2, 3details
#120.04 s1, 2, 3details
#130.27 s2, 3details
#140.33 s2, 3details
#150.47 s2, 3details
#160.63 s2, 3details
#170.32 s2, 3details
#180.46 s2, 3details
#190.04 s2, 3details
#200.04 s2, 3details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#260.97 s3details
#270.40 s3details
#280.26 s3details

Code

import itertools
import math
import random

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):
    if dist <= 1:
        return 1

    return max(1, int(math.floor(math.log(dist))))

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

    biggest_num = int('1' * str_len)
    b = min(b, biggest_num)

    try:
        startIndex = 0
        step = decide_step(a)
        # print('start with start step {}'.format(step))
        while products[startIndex] < a:
            startIndex = min(products_len - 1, startIndex + step)
            if startIndex + 1 == products_len:
                break

            step = decide_step(abs(a - products[startIndex]))
            # print('new start step is {}, cur index is {}'.format(step, startIndex))

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

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

        endIndex = -1
        step = decide_step(b)
        # print('start with end step {}'.format(step))
        while products[endIndex] > b:
            endIndex = max(-products_len + 1, endIndex - step)
            if endIndex - 1 == -products_len:
                break

            step = decide_step(abs(b - products[endIndex]))
            # print('new end step is {}'.format(step))
        
        while endIndex < 0 and products[endIndex] < b:
            # print('we need to go BACK: {}, {}'.format(endIndex, products[endIndex]))
            endIndex += 1

        if endIndex + 1 == 0:
            endIndex = products_len

        # print(a, b)
        # print(products_len, startIndex, endIndex)
        # print(products[startIndex:endIndex])
        return products_len + min(0, endIndex) - startIndex
    except IndexError:
        return 0

def slowsolve(a, b):
    count = 0
    # res = list()
    for x in range(a, b):
        if all(val == '1' or val == '0' for val in set(str(x))):
            count += 1
            # res.append(x)

    # print(res)
    return count

# for x in range(0, 10000):
#     a = random.randint(0, pow(10, random.randint(0, 2)))
#     b = random.randint(pow(10, 3), pow(10, 6))

#     our_solution = solve(a, b + 1)
#     print('our solution for [{}, {}]: {}'.format(a, b, our_solution))
#     slow_solution = slowsolve(a, b)
#     print('slow solution: {}'.format(slow_solution))

#     if our_solution != slow_solution:
#         break

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
2
1
0
1

Test 2

Group: 1, 2, 3

Verdict:

input
1
0 0

correct output
1

user output
2

Test 3

Group: 1, 2, 3

Verdict:

input
1
1000 1000

correct output
1

user output
0

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
2
2
2
1
1
...

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
2
2
2
4
4
...

Test 6

Group: 1, 2, 3

Verdict:

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

correct output
9
9
9
9
9
...

user output
8
8
8
8
8
...

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
4
5
1
4
7
...

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
0
0
0
4
0
...

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
4
6
4
1
7
...

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
2
1
0
0
0
...

Test 11

Group: 1, 2, 3

Verdict:

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

correct output
9
8
8
8
7
...

user output
8
8
7
8
7
...

Test 12

Group: 1, 2, 3

Verdict:

input
1
0 1000

correct output
9

user output
8

Test 13

Group: 2, 3

Verdict:

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

correct output
33
33
33
33
33
...

user output
32
32
32
32
32
...

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
0
0
0
16
0
...

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
13
9
1
2
7
...

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
14
0
4
1
5
...

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
2
1
0
0
0
...

Test 18

Group: 2, 3

Verdict:

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

correct output
33
32
32
32
31
...

user output
32
32
31
32
31
...

Test 19

Group: 2, 3

Verdict:

input
3
99999 99999
99999 100000
100000 100000

correct output
0
1
1

user output
0
0
0

Test 20

Group: 2, 3

Verdict:

input
1
0 100000

correct output
33

user output
32

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
262144
262144
262143
262144
262143
...

Test 27

Group: 3

Verdict:

input
3
999999999999999999 99999999999...

correct output
0
1
1

user output
0
0
0

Test 28

Group: 3

Verdict:

input
1
0 1000000000000000000

correct output
262145

user output
262144