CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:Epe
Submission time:2019-10-07 01:20:44 +0300
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.07 s1, 2, 3details
#2ACCEPTED0.07 s1, 2, 3details
#3ACCEPTED0.07 s1, 2, 3details
#40.07 s1, 2, 3details
#5ACCEPTED0.07 s1, 2, 3details
#6ACCEPTED0.07 s1, 2, 3details
#70.07 s1, 2, 3details
#80.07 s1, 2, 3details
#90.07 s1, 2, 3details
#100.07 s1, 2, 3details
#110.08 s1, 2, 3details
#12ACCEPTED0.07 s1, 2, 3details
#13ACCEPTED0.23 s2, 3details
#140.24 s2, 3details
#150.24 s2, 3details
#160.23 s2, 3details
#170.23 s2, 3details
#180.23 s2, 3details
#190.07 s2, 3details
#20ACCEPTED0.07 s2, 3details
#210.27 s3details
#220.31 s3details
#230.32 s3details
#240.32 s3details
#250.31 s3details
#260.27 s3details
#270.07 s3details
#280.07 s3details

Compiler report

input/code.cpp: In function 'int lower(int, int, int)':
input/code.cpp:8:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Code

#include <bits/stdc++.h>
using namespace std;

vector<unsigned long long> seen(70000);

int lower(int target, int mid, int rad){

}

int digits(unsigned long long input){
    return ceil(log10(input+1));
}

unsigned long long parse(unsigned long long input){
    if(seen[input] != 0){
        return seen[input];
    }
    unsigned long long temp = 0;
    for(int i = 0; input > 0; i++){
        temp+=(input%(unsigned long long)2)*(unsigned long long)pow(10,i);
        input/=2;
    }
    seen[input] = temp;
    return temp;
}

int main(){
    for(int i = 0; i < 70000; i++){
        seen[i] = parse(i);
    }

    int amount;
    cin >> amount;

    vector<long long> counts;



    for(int l = 0; l < amount; l++){
        unsigned long long  a,b;
        cin >> a >> b;

        auto it1 = upper_bound(seen.begin(), seen.end(), a);
        auto it2 = upper_bound(seen.begin(), seen.end(), b);

        int dist = distance(it1, it2);
        if(dist == 0){
            dist++;
        }
        if(dist < 0){
            dist = 0;
        }

        cout << dist << endl;

        //cout << *upper_bound(seen.begin(), seen.end(), a) << " and " << *upper_bound(seen.begin(), seen.end(), b) << endl;

        /*
        if(a!=0) {
            for (unsigned long long i = 1; i < pow(2, 100); i *= 2) {
                unsigned long long dig = parse(i);

                if (dig > a) {
                    bool found = false;
                    for (int s = i+1; s > 0; s--) {
                        unsigned long long  temp = parse(s);
                        if (temp < a) {
                            a = s + 1;
                            found = true;
                            break;
                        }
                    }
                    break;
                }
            }
        }

        if(b != 0) {
            for (unsigned long long i = 1; i < pow(2, 100); i *= 2) {
                unsigned long long dig = parse(i);//pow?

                if (dig > b) {
                    for (int s = i; s >= 0; s--) {
                        unsigned long long  temp = parse(s);
                        if (temp <= b) {
                            b = s;
                            break;
                        }
                    }
                    break;
                }
            }
        }
        counts.push_back((b-a)+1);
        */
    }
    /*
    for(int i = 0; i < amount; i++){
        cout << counts[i] << endl;
    }*/
}

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
3
1
1
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:

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

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

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

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

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
9
8
7
8
6
...
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
1
1
1
16
1
...
Truncated

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

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

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

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
33
32
31
32
30
...
Truncated

Test 19

Group: 2, 3

Verdict:

input
3
99999 99999
99999 100000
100000 100000

correct output
0
1
1

user output
1
1
1

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

Test 22

Group: 3

Verdict:

input
100000
179926689319432205 25677963778...

correct output
0
0
0
0
0
...

user output
1
1
1
1
1
...
Truncated

Test 23

Group: 3

Verdict:

input
100000
100110100011010101 11100011010...

correct output
74822
54944
140968
252594
23521
...

user output
1
54943
1
69504
1
...
Truncated

Test 24

Group: 3

Verdict:

input
100000
100110100011010102 11100011010...

correct output
74822
252594
94086
10836
11352
...

user output
1
69504
8202
1
1
...
Truncated

Test 25

Group: 3

Verdict:

input
100000
256779637786129463 25677963778...

correct output
0
0
0
0
0
...

user output
1
1
1
1
1
...
Truncated

Test 26

Group: 3

Verdict:

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

correct output
262145
262144
262144
262144
262143
...

user output
70000
70000
69998
70000
69998
...
Truncated

Test 27

Group: 3

Verdict:

input
3
999999999999999999 99999999999...

correct output
0
1
1

user output
1
1
1

Test 28

Group: 3

Verdict:

input
1
0 1000000000000000000

correct output
262145

user output
70000