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

Code

// Lukuvälit

#include <iostream>
#include <utility>
#include <vector>

using namespace std;

using i64 = int64_t;

i64 hob(i64 i)
{
    return 1ll << (64ll -
                   static_cast<int64_t>(
                       __builtin_clzll(static_cast<uint64_t>(i))) -
                   1ll);
}
i64 round_up_10(i64 i)
{
    return ((i + 10ll - 1ll) / 10ll) * 10ll;
}

static constexpr i64 powers_of_10[] = {1'000'000'000,
                                       1'000'000'000,
                                       100'000'000,
                                       100'000'000,
                                       100'000'000,
                                       10'000'000,
                                       10'000'000,
                                       10'000'000,
                                       1'000'000,
                                       1'000'000,
                                       1'000'000,
                                       1'000'000,
                                       100'000,
                                       100'000,
                                       100'000,
                                       10000,
                                       10000,
                                       10000,
                                       1000,
                                       1000,
                                       1000,
                                       1000,
                                       100,
                                       100,
                                       100,
                                       10,
                                       10,
                                       10,
                                       1,
                                       1,
                                       1,
                                       1,
                                       1};
i64 first_digit(i64 i)
{
    auto lz = static_cast<i64>(__builtin_clzll(static_cast<uint64_t>(i)));
    i /= powers_of_10[lz - 32];
    if (i >= 10) {
        return 1;
    }
    else {
        return i;
    }
}

bool consists_of_zeroes_or_ones(i64 i)
{
    while (i > 0) {
        auto digit = i % 10;
        if (digit != 0 && digit != 1) {
            return false;
        }
        i /= 10;
    }
    return true;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<pair<i64, i64>> vec(n);
    for (int i = 0; i < n; ++i) {
        i64 a, b;
        cin >> a >> b;
        vec[i] = make_pair(a, b);
    }

    for (auto& p : vec) {
        int counter = 0;
        if (p.first == 0) {
            ++counter;
            ++p.first;
        }
        for (auto i = p.first; i <= p.second; ++i) {
            if (first_digit(i) != 1) {
                i = round_up_10(i) - 1;
                continue;
            }
            if (i >= 1111111111111111112ll) {
                break;
            }
            if (consists_of_zeroes_or_ones(i)) {
                ++counter;
            }
        }
        cout << counter << '\n';
        // printf("[%ld, %ld]: %d\n", p.first, p.second, counter);
    }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
4
0 10
1 5
3 4
11 11

correct output
3
1
0
1

user output
3
1
0
1

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
0 0

correct output
1

user output
1

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: ACCEPTED

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

correct output
1
2
2
1
1
...

user output
1
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
(empty)

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
(empty)

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:

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

correct output
9
8
8
8
7
...

user output
(empty)

Test 12

Group: 1, 2, 3

Verdict:

input
1
0 1000

correct output
9

user output
(empty)

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
(empty)

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:

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

correct output
33
32
32
32
31
...

user output
(empty)

Test 19

Group: 2, 3

Verdict: ACCEPTED

input
3
99999 99999
99999 100000
100000 100000

correct output
0
1
1

user output
0
1
1

Test 20

Group: 2, 3

Verdict:

input
1
0 100000

correct output
33

user output
(empty)

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:

input
1
0 1000000000000000000

correct output
262145

user output
(empty)