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

Code

// Lukuvälit

#include <algorithm>
#include <iostream>
#include <numeric>
#include <set>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using i64 = int64_t;
using u64 = uint64_t;

constexpr i64 round_up_10(i64 i)
{
    return ((i + 10ll - 1ll) / 10ll) * 10ll;
}

static constexpr i64 precalc[] = {0,    1,    10,   11,   100,  101,
                                  110,  111,  1000, 1001, 1010, 1011,
                                  1100, 1101, 1110, 1111};

template <typename T>
constexpr T power_of_10(T x)
{
    T i = 1;
    for (T j = 1; j <= x; j++) {
        i *= 10;
    }
    return i;
}

struct pretend_binary {
    // store in decimal
    u64 value{0};

    // if value == 3, returns 11 in base 10,
    // which looks like 0b11
    i64 as_integer()
    {
        i64 val{0};
        for (u64 k = 0; k < 64ull - __builtin_clzll(value); ++k) {
            auto mask = 1 << k;
            auto masked = value & mask;
            val += (masked >> k) * power_of_10(k);
        }
        return val;
    }
};

static constexpr auto n_precalc = sizeof(precalc) / sizeof(*precalc);
static constexpr auto max_precalc = precalc[n_precalc - 1];

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

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

    // set<i64> cache{begin(precalc), end(precalc)};
    vector<i64> cache{begin(precalc), end(precalc)};
    if (largest_end >= max_precalc) {
        pretend_binary bin{16};  // 10000
        i64 i = bin.as_integer();
        for (; i <= largest_end; ++bin.value) {
            i = bin.as_integer();
            // cache.insert(cache.end(), i);
            cache.push_back(i);
        }
    }

    for (auto& p : vec) {
        // auto begin = cache.lower_bound(p.first);
        // auto end = cache.upper_bound(p.second);
        auto begin = lower_bound(cache.begin(), cache.end(), p.first);
        auto end = upper_bound(cache.begin(), cache.end(), p.second);
        cout << distance(begin, end) << '\n';
    }
}

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

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

correct output
1
2
3
4
5
...

user output
1
2
3
4
5
...

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

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
4
6
2
5
8
...

user output
4
6
2
5
8
...

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

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

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

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

correct output
1
1
0
0
0
...

user output
1
1
0
0
0
...

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

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

Test 14

Group: 2, 3

Verdict: ACCEPTED

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

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

correct output
14
10
2
2
8
...

user output
14
10
2
2
8
...

Test 16

Group: 2, 3

Verdict: ACCEPTED

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

correct output
14
1
4
2
6
...

user output
14
1
4
2
6
...

Test 17

Group: 2, 3

Verdict: ACCEPTED

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

correct output
1
1
0
0
0
...

user output
1
1
0
0
0
...

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

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

input
1
0 100000

correct output
33

user output
33

Test 21

Group: 3

Verdict: ACCEPTED

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

correct output
262145
262145
262145
262145
262145
...

user output
262145
262145
262145
262145
262145
...

Test 22

Group: 3

Verdict: ACCEPTED

input
100000
179926689319432205 25677963778...

correct output
0
0
0
0
0
...

user output
0
0
0
0
0
...

Test 23

Group: 3

Verdict: ACCEPTED

input
100000
100110100011010101 11100011010...

correct output
74822
54944
140968
252594
23521
...

user output
74822
54944
140968
252594
23521
...

Test 24

Group: 3

Verdict: ACCEPTED

input
100000
100110100011010102 11100011010...

correct output
74822
252594
94086
10836
11352
...

user output
74822
252594
94086
10836
11352
...

Test 25

Group: 3

Verdict: ACCEPTED

input
100000
256779637786129463 25677963778...

correct output
0
0
0
0
0
...

user output
0
0
0
0
0
...

Test 26

Group: 3

Verdict: ACCEPTED

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

correct output
262145
262144
262144
262144
262143
...

user output
262145
262144
262144
262144
262143
...

Test 27

Group: 3

Verdict: ACCEPTED

input
3
999999999999999999 99999999999...

correct output
0
1
1

user output
0
1
1

Test 28

Group: 3

Verdict: ACCEPTED

input
1
0 1000000000000000000

correct output
262145

user output
262145