CSES - Datatähti 2020 alku - Results
Submission details
Task:Lukuvälit
Sender:Microwave Abuser
Submission time:2019-10-01 18:08:33 +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.04 s2, 3details
#14ACCEPTED0.06 s2, 3details
#15ACCEPTED0.05 s2, 3details
#16ACCEPTED0.05 s2, 3details
#17ACCEPTED0.05 s2, 3details
#18ACCEPTED0.05 s2, 3details
#19ACCEPTED0.01 s2, 3details
#20ACCEPTED0.01 s2, 3details
#21ACCEPTED0.05 s3details
#22ACCEPTED0.08 s3details
#23ACCEPTED0.09 s3details
#24ACCEPTED0.09 s3details
#25ACCEPTED0.08 s3details
#26ACCEPTED0.06 s3details
#27ACCEPTED0.01 s3details
#28ACCEPTED0.01 s3details

Code

//g++ -std=c++14 -O2 -Wall datatahti.cpp -o kys
#include <bits/stdc++.h>
using namespace std;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	//kys
	int n;
	cin >> n;
	long long gayarray [n+1][2];
	for(int pari = 1; pari <= n; pari++)	//Kerää input
	{
		cin >> gayarray[pari][0] >> gayarray[pari][1];
	}
	for(int pari = 1; pari <= n; pari++)	//Jokaista paria kohden
	{
		//CONTINUE HERE!!!
		long long tester = 1000000000000000000;
		int binSlot = 18;	//0 slot = 1. bit
		int binNumber = 0;
		long long parseNumber = gayarray[pari][0];
		while(true)	//finding the lowest 100101
		{
			if(parseNumber-tester == 0)	//If cur num = 1, ja loput 0
			{
				//set binNumber's binSlot 'th bit on
				binNumber |= 1UL << binSlot;
				break;
			}
			else if(parseNumber-tester < 0)	//if cur num = 0
			{
				binSlot--;
				tester = tester/10;
			}
			else if(parseNumber-tester*2 >= 0)	//if cur num 2 or bigger
			{
				binSlot++;
				binNumber += pow(2, binSlot);
				break;
			}
			else	//cur num 1
			{
				//set binNumber's binSlot 'th bit on
				binNumber |= 1UL << binSlot;
				parseNumber -= tester;
				binSlot--;
				tester = tester/10;
			}
		}
		tester = 1000000000000000000;
		binSlot = 18;	//0 slot = 1. bit
		int binOver = 0;
		parseNumber = gayarray[pari][1];
		while(true)	//finding the lowest over limit 100101
		{
			if(parseNumber-tester == 0)	//If cur num = 1, ja loput 0
			{
				//set binOver's binSlot 'th bit on
				binOver |= 1UL << binSlot;
				binOver += 1;
				break;
			}
			else if(parseNumber-tester < 0)	//if cur num = 0
			{
				binSlot--;
				tester = tester/10;
			}
			else if(parseNumber-tester*2 >= 0)	//if cur num 2 or bigger
			{
				binSlot++;
				binOver += pow(2, binSlot);
				break;
			}
			else	//cur num 1
			{
				//set binOver's binSlot 'th bit on
				binOver |= 1UL << binSlot;
				parseNumber -= tester;
				binSlot--;
				tester = tester/10;
			}
		}
		int count = 0;
		while(binNumber < binOver)
		{
			count++;
			binNumber++;
		}
		cout << count << "\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