CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:aki
Submission time:2019-10-05 18:04:26 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.09 s1, 2, 3details
#20.08 s1, 2, 3details
#3ACCEPTED0.08 s1, 2, 3details
#40.09 s1, 2, 3details
#50.09 s1, 2, 3details
#60.72 s1, 2, 3details
#70.73 s1, 2, 3details
#80.72 s1, 2, 3details
#90.73 s1, 2, 3details
#100.72 s1, 2, 3details
#110.73 s1, 2, 3details
#120.08 s1, 2, 3details
#13--2, 3details
#14--2, 3details
#15--2, 3details
#16--2, 3details
#17--2, 3details
#18--2, 3details
#19ACCEPTED0.08 s2, 3details
#200.08 s2, 3details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#270.09 s3details
#280.08 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:63:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(possible.size() < count)
            ~~~~~~~~~~~~~~~~^~~~~~~

Code

#include <iostream>
#include <cstring>

int laske(const int64_t* possible, unsigned int n, int a, int b)
{
    int n_cont = 0;
    for(unsigned int i = 0; i < n; i++)
    {
        int v = possible[i];
        if((v >= a) && (v <= b))
        {
            // std::cout << v << " (" << a << ", " << b << ")\n";
            n_cont++;
        } 
    }
    return n_cont;
}

#include <vector>
#include <utility>
#include <sstream>

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


    char buffer[26];

    memset(buffer, '0', 25);
    buffer[25] = 0;
    std::vector<int64_t> possible;
    int count = 0;
    possible.resize(1024);
    possible[0] = 0;
    count++;
    for(unsigned int i = 0; i < 500000; i++)
    {
        bool carry = true;
        for(unsigned int k = 0; k < 25; k++)
        {
            if(buffer[24 - k] == '0')
            {
                if(carry)
                    buffer[24 - k] = '1';
                carry = false;
            }
            else
            {
                if(carry)
                {
                    buffer[24 - k] = '0';
                    carry = true;
                }
                else
                {
                    carry = false;
                }
            }
        }
        int64_t val = ::atoll(buffer);
        if(possible.size() < count)
        {
            possible.resize(possible.size() + 300);
        }
        possible[count++] = val;
        if(val == 1111111111111111111)
        {
            break;
        }
    }

    int n;
    std::cin >> n;

    std::ostream& ss = std::cout;
        
    for(int i = 0; i < n; i++)
    {
        int a, b;
        std::cin >> a >> b;
        ss << laske(possible.data(), count, a, b);
        if(i < n - 1)
            ss << "\n";
    }
    //std::cout << ss.str();
    return 0;
}

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

Test 2

Group: 1, 2, 3

Verdict:

input
1
0 0

correct output
1

user output
1665

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
1665
1666
1666
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
1665
1666
1667
1668
1669
...

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

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
1670
2
5
8
...

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
1665
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
1673
1672
8
1672
7
...

Test 12

Group: 1, 2, 3

Verdict:

input
1
0 1000

correct output
9

user output
1673

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
1729

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

Test 28

Group: 3

Verdict:

input
1
0 1000000000000000000

correct output
262145

user output
252576