CSES - Datatähti 2020 alku

Submission details
Task:	Lukuvälit
Sender:	Swarm
Submission time:	2019-10-11 15:26:20 +0300
Language:	C++ (C++17)
Status:	READY
Result:	36

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	ACCEPTED	24
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.01 s	1, 2, 3	details
#10	ACCEPTED	0.01 s	1, 2, 3	details
#11	ACCEPTED	0.01 s	1, 2, 3	details
#12	ACCEPTED	0.01 s	1, 2, 3	details
#13	ACCEPTED	0.06 s	2, 3	details
#14	ACCEPTED	0.06 s	2, 3	details
#15	ACCEPTED	0.06 s	2, 3	details
#16	ACCEPTED	0.06 s	2, 3	details
#17	ACCEPTED	0.06 s	2, 3	details
#18	ACCEPTED	0.05 s	2, 3	details
#19	ACCEPTED	0.01 s	2, 3	details
#20	ACCEPTED	0.01 s	2, 3	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	TIME LIMIT EXCEEDED	--	3	details
#23	TIME LIMIT EXCEEDED	--	3	details
#24	TIME LIMIT EXCEEDED	--	3	details
#25	TIME LIMIT EXCEEDED	--	3	details
#26	TIME LIMIT EXCEEDED	--	3	details
#27	WRONG ANSWER	0.03 s	3	details
#28	ACCEPTED	0.01 s	3	details

Compiler report

input/code.cpp:24:2: warning: integer constant is so large that it is unsigned
  10'000'000'000'000'000'000
  ^~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:77:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a%powsOf10[i] == a)
       ~~~~~~~~~~~~~~^~~~
input/code.cpp:86:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (b % powsOf10[i] == b)
        ~~~~~~~~~~~~~~~~^~~~
input/code.cpp:109:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if (a < (powsOf10[omA] + temp))
          ~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:123:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if (a < (powsOf10[omA] + temp))
          ~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:145:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if (b < (p...

Code

#include<iostream>

unsigned long long powsOf10[20]
{
	1,
	10,
	100,
	1'000,
	10'000,
	100'000,
	1'000'000,
	10'000'000,
	100'000'000,
	1'000'000'000,
	10'000'000'000,
	100'000'000'000,
	1'000'000'000'000,
	10'000'000'000'000,
	100'000'000'000'000,
	1'000'000'000'000'000,
	10'000'000'000'000'000,
	100'000'000'000'000'000,
	1'000'000'000'000'000'000,
	10'000'000'000'000'000'000
};

unsigned long long ones[19]
{
	1,
	11,
	111,
	1'111,
	11'111,
	111'111,
	1'111'111,
	11'111'111,
	111'111'111,
	1'111'111'111,
	11'111'111'111,
	111'111'111'111,
	1'111'111'111'111,
	11'111'111'111'111,
	111'111'111'111'111,
	1'111'111'111'111'111,
	11'111'111'111'111'111,
	111'111'111'111'111'111,
	1'111'111'111'111'111'111
};

int main()
{
	int n;
	scanf("%d", &n);;

	long long a;
	long long b;
	long long temp1;
	long long temp;

	int toA = 0;
	int toB = 0;
	int between;

	int omA = 0;
	int omB = 0;

	bool aValid = false;
	bool bValid = false;

	for (int i = 0; i < n; i++)
	{
		scanf("%lld", &a);
		scanf("%lld", &b);

		for (int i = 1; i < 20; i++)
		{
			if(a%powsOf10[i] == a)
			{
				omA = i - 1;
				break;
			}
		}

		for (int i = 1; i < 20; i++)
		{
			if (b % powsOf10[i] == b)
			{
				omB = i - 1;
				break;
			}
		}

		if (a == 0)
			toA = 1;
		else
		{
			toA = 2 << omA;

			if (omA == 0)
			{
				for (int i = 0; i < 2; i++)
				{
					temp = 0;
					for (int j = 0; j < omA; j++)
					{
						temp += powsOf10[j] * (i >> j & 1);
					}

					if (a < (powsOf10[omA] + temp))
						toA--;
				}
			}
			else
			{
				for (int i = 0; i < (2 << (omA - 1)); i++)
				{
					temp = 0;
					for (int j = 0; j < omA; j++)
					{
						temp += powsOf10[j] * (i >> j & 1);
					}

					if (a < (powsOf10[omA] + temp))
						toA--;
				}
			}
		}

		if (b == 0)
			toB = 1;
		else
		{
			toB = 2 << omB;

			if (omB == 0)
			{
				for (int i = 0; i < 2; i++)
				{
					temp = 0;
					for (int j = 0; j < omB; j++)
					{
						temp += powsOf10[j] * (i >> j & 1);
					}

					if (b < (powsOf10[omB] + temp))
						toB--;
				}
			}
			else
			{
				for (int i = 0; i < (2 << (omB-1)); i++)
				{
					temp = 0;
					for (int j = 0; j < omB; j++)
					{
						temp += powsOf10[j] * (i >> j & 1);
					}

					if (b < (powsOf10[omB] + temp))
						toB--;
				}
			}
		}

		aValid = true;

		int tempA = a;
		while (tempA > 0)
		{
			int remainder = tempA % 10;
			if (remainder != 0 && remainder != 1)
			{
				aValid = false;
				break;
			}
			tempA /= 10;
		}

		bValid = true;

		int tempB = b;
		while (tempB > 0)
		{
			int remainder = tempB % 10;
			if (remainder != 0 && remainder != 1)
			{
				bValid = false;
				break;
			}
			tempB /= 10;
		}

		between = toB - toA + aValid;

		printf("%d\n", between);
	}

	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 0 10 1 5 3 4 11 11` view save

correct output
`3 1 0 1` view save

user output
`3 1 0 1` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 0 0` view save

correct output
`1` view save

user output
`1` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 1000 1000` view save

correct output
`1` view save

user output
`1` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`16 0 0 0 1 0 2 1 1 ...` view save

correct output
`1 2 2 1 1 ...` view save

user output
`1 2 2 1 1 ...` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`9 0 0 0 1 0 10 0 11 ...` view save

correct output
`1 2 3 4 5 ...` view save

user output
`1 2 3 4 5 ...` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 0 1000 0 1000 0 1000 0 1000 ...` view save

correct output
`9 9 9 9 9 ...` view save

user output
`9 9 9 9 9 ...` Truncated

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 100 111 0 101 1 10 10 110 ...` view save

correct output
`4 6 2 5 8 ...` view save

user output
`4 6 2 5 8 ...` Truncated

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 480 564 753 988 479 909 32 973 ...` view save

correct output
`0 0 0 4 0 ...` view save

user output
`0 0 0 4 0 ...` Truncated

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 98 111 8 111 98 111 111 113 ...` view save

correct output
`4 6 4 1 7 ...` view save

user output
`4 6 4 1 7 ...` Truncated

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 0 0 1 1 2 2 3 3 ...` view save

correct output
`1 1 0 0 0 ...` view save

user output
`1 1 0 0 0 ...` Truncated

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 0 1000 0 999 1 1000 0 998 ...` view save

correct output
`9 8 8 8 7 ...` view save

user output
`9 8 8 8 7 ...` Truncated

Test 12

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 0 1000` view save

correct output
`9` view save

user output
`9` view save

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
`100000 0 100000 0 100000 0 100000 0 100000 ...` view save

correct output
`33 33 33 33 33 ...` view save

user output
`33 33 33 33 33 ...` Truncated

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
`100000 86042 98295 30077 80920 45856 67174 3890 60412 ...` view save

correct output
`0 0 0 16 0 ...` view save

user output
`0 0 0 16 0 ...` Truncated

Test 15

Group: 2, 3

Verdict: ACCEPTED

input
`100000 11 10000 1111 11000 1011 1100 1110 1111 ...` view save

correct output
`14 10 2 2 8 ...` view save

user output
`14 10 2 2 8 ...` Truncated

Test 16

Group: 2, 3

Verdict: ACCEPTED

input
`100000 9 9999 1109 1110 112 1012 11098 11101 ...` view save

correct output
`14 1 4 2 6 ...` view save

user output
`14 1 4 2 6 ...` Truncated

Test 17

Group: 2, 3

Verdict: ACCEPTED

input
`100000 0 0 1 1 2 2 3 3 ...` view save

correct output
`1 1 0 0 0 ...` view save

user output
`1 1 0 0 0 ...` Truncated

Test 18

Group: 2, 3

Verdict: ACCEPTED

input
`100000 0 100000 0 99999 1 100000 0 99998 ...` view save

correct output
`33 32 32 32 31 ...` view save

user output
`33 32 32 32 31 ...` Truncated

Test 19

Group: 2, 3

Verdict: ACCEPTED

input
`3 99999 99999 99999 100000 100000 100000` view save

correct output
`0 1 1` view save

user output
`0 1 1` view save

Test 20

Group: 2, 3

Verdict: ACCEPTED

input
`1 0 100000` view save

correct output
`33` view save

user output
`33` view save

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 0 1000000000000000000 0 1000000000000000000 0 1000000000000000000 0 1000000000000000000 ...` view save

correct output
`262145 262145 262145 262145 262145 ...` view save

user output
(empty)

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 179926689319432205 25677963778...` view save

correct output
`0 0 0 0 0 ...` view save

user output
(empty)

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 100110100011010101 11100011010...` view save

correct output
`74822 54944 140968 252594 23521 ...` view save

user output
(empty)

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 100110100011010102 11100011010...` view save

correct output
`74822 252594 94086 10836 11352 ...` view save

user output
(empty)

Test 25

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 256779637786129463 25677963778...` view save

correct output
`0 0 0 0 0 ...` view save

user output
(empty)

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 0 1000000000000000000 0 999999999999999999 1 1000000000000000000 0 999999999999999998 ...` view save

correct output
`262145 262144 262144 262144 262143 ...` view save

user output
(empty)

Test 27

Group: 3

Verdict: WRONG ANSWER

input
`3 999999999999999999 99999999999...` view save

correct output
`0 1 1` view save

user output
`1 2 1` view save

Test 28

Group: 3

Verdict: ACCEPTED

input
`1 0 1000000000000000000` view save

correct output
`262145` view save

user output
`262145` view save

Datatähti 2020 alku

Lukuvälit

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Tasks

Submissions (Swarm)