CSES - Datatähti 2018 alku

Submission details
Task:	Bittijono
Sender:	SeveriK
Submission time:	2017-10-10 22:24:10 +0300
Language:	C++
Status:	READY
Result:	22

Feedback
group	verdict	score
#1	ACCEPTED	7
#2	ACCEPTED	15
#3	WRONG ANSWER	0
#4	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.04 s	1	details
#2	ACCEPTED	0.05 s	1	details
#3	ACCEPTED	0.07 s	1	details
#4	ACCEPTED	0.05 s	1	details
#5	ACCEPTED	0.06 s	1	details
#6	ACCEPTED	0.07 s	1	details
#7	ACCEPTED	0.07 s	1	details
#8	ACCEPTED	0.04 s	1	details
#9	ACCEPTED	0.08 s	1	details
#10	ACCEPTED	0.04 s	1	details
#11	ACCEPTED	0.05 s	2	details
#12	ACCEPTED	0.03 s	2	details
#13	ACCEPTED	0.05 s	2	details
#14	ACCEPTED	0.05 s	2	details
#15	ACCEPTED	0.05 s	2	details
#16	ACCEPTED	0.04 s	2	details
#17	ACCEPTED	0.07 s	2	details
#18	ACCEPTED	0.06 s	2	details
#19	ACCEPTED	0.06 s	2	details
#20	ACCEPTED	0.06 s	2	details
#21	ACCEPTED	0.07 s	3	details
#22	ACCEPTED	0.06 s	3	details
#23	ACCEPTED	0.10 s	3	details
#24	WRONG ANSWER	0.08 s	3	details
#25	WRONG ANSWER	0.07 s	3	details
#26	WRONG ANSWER	0.06 s	3	details
#27	WRONG ANSWER	0.09 s	3	details
#28	ACCEPTED	0.06 s	3	details
#29	WRONG ANSWER	0.06 s	3	details
#30	WRONG ANSWER	0.07 s	3	details
#31	TIME LIMIT EXCEEDED	--	4	details
#32	TIME LIMIT EXCEEDED	--	4	details
#33	TIME LIMIT EXCEEDED	--	4	details
#34	TIME LIMIT EXCEEDED	--	4	details
#35	TIME LIMIT EXCEEDED	--	4	details
#36	TIME LIMIT EXCEEDED	--	4	details
#37	TIME LIMIT EXCEEDED	--	4	details
#38	TIME LIMIT EXCEEDED	--	4	details
#39	TIME LIMIT EXCEEDED	--	4	details
#40	TIME LIMIT EXCEEDED	--	4	details

Code

/*
#include <iostream>
#include <fstream>
#include <string>
#include <vector>

using namespace std;

int main()
{
	string rows[10];
	for (int i = 0; i < 10; i++)
	{
		for (int o = 0; o < 10; o++)
		{
			int n = 0;
			if (i < 10 / 2)
			{
				n = i + o;
			}
			else if (i < 9)
			{
				n = i + o + 1;
			}
			else
			{
				n = i + o + 6;
			}
			while (n > 9)
			{
				n -= 10;
			}
			rows[i] += to_string(n);

			if (i < 9)
			{
				n = o - i;
			}
			else
			{
				n = o - i;
			}
			while (n < 0)
			{
				n += 10;
			}

			if (n == 0)
			{
				rows[i] += "A";
			}
			else if (n == 1)
			{
				rows[i] += "B";
			}
			else if (n == 2)
			{
				rows[i] += "C";
			}
			else if (n == 3)
			{
				rows[i] += "D";
			}
			else if (n == 4)
			{
				rows[i] += "E";
			}
			else if (n == 5)
			{
				rows[i] += "F";
			}
			else if (n == 6)
			{
				rows[i] += "G";
			}
			else if (n == 7)
			{
				rows[i] += "H";
			}
			else if (n == 8)
			{
				rows[i] += "I";
			}
			else if (n == 9)
			{
				rows[i] += "J";
			}
			if (o != 9)
			{
				rows[i] += " ";
			}
		}
		std::cout << rows[i] << "\n";
	}

	ofstream myfile;
	myfile.open("Eppapeli.txt");
	if (myfile.is_open())
	{
		for (int i = 0; i < 10; i++)
		{
			if (i != 10 - 1)
			{
				myfile << rows[i] + "\n";
			}
			else
			{
				myfile << rows[i];
			}
		}
		myfile.close();
	}

	int a;
	std::cin >> a;

	return 0;
}
}*/

#include <iostream>
#include <string>
#include <vector>
#include <bitset>

using namespace std;

int main()
{
	const int MAX_CHAR = 64;
	const int SEQUENCE_SIZE = 32;

	unsigned long long int complexity = 0;
	unsigned long long int subCount = 0;
	unsigned long long int i = 0;
	string bitSeq = "1";

	unsigned long long int k;
	std::cin >> k;
	if (k > 3000)
	{

		unsigned long long int l = 1;
		while (subCount < k)
		{
			if (l % 2)
			{
				bitSeq += '0';
			}
			else
			{
				bitSeq += '1';
			}
			l++;
			vector<unsigned long long int>last(MAX_CHAR, -1);

			const unsigned long long int n = bitSeq.length();

			unsigned long long int* dp = new unsigned long long int[n + 1];
			dp[0] = 1;

			for (unsigned long long int o = 1; o <= n; o++)
			{
				dp[o] = 2 * dp[o - 1];

				if (last[bitSeq[o - 1]] != (unsigned long long int) - 1)
				{
					dp[o] = dp[o] - dp[last[bitSeq[o - 1]]];
				}

				last[bitSeq[o - 1]] = (o - 1);
			}
			subCount = dp[n] - 1;
		}

		unsigned long long int fullLength = l;
		unsigned long long int halfLength = l / 2;
		l = 1;
		while (l < halfLength && subCount > k)
		{
			bitSeq[l] = '1';
			l += 2;

			vector<unsigned long long int>last(MAX_CHAR, -1);

			const unsigned long long int n = bitSeq.length();

			unsigned long long int* dp = new unsigned long long int[n + 1];
			dp[0] = 1;

			for (unsigned long long int o = 1; o <= n; o++)
			{
				dp[o] = 2 * dp[o - 1];

				if (last[bitSeq[o - 1]] != (unsigned long long int) - 1)
				{
					dp[o] = dp[o] - dp[last[bitSeq[o - 1]]];
				}

				last[bitSeq[o - 1]] = (o - 1);
			}
			subCount = dp[n] - 1;
		}

		l = fullLength - 1;
		while (l >= halfLength && subCount > k)
		{
			bitSeq[l] = '0';
			l--;

			vector<unsigned long long int>last(MAX_CHAR, -1);

			const unsigned long long int n = bitSeq.length();

			unsigned long long int* dp = new unsigned long long int[n + 1];
			dp[0] = 1;

			for (unsigned long long int o = 1; o <= n; o++)
			{
				dp[o] = 2 * dp[o - 1];

				if (last[bitSeq[o - 1]] != (unsigned long long int) - 1)
				{
					dp[o] = dp[o] - dp[last[bitSeq[o - 1]]];
				}

				last[bitSeq[o - 1]] = (o - 1);
			}
			subCount = dp[n] - 1;
		}
		l = 1;
		while (l < fullLength && subCount > k)
		{
			bitSeq[l] = '1';
			l++;

			vector<unsigned long long int>last(MAX_CHAR, -1);

			const unsigned long long int n = bitSeq.length();

			unsigned long long int* dp = new unsigned long long int[n + 1];
			dp[0] = 1;

			for (unsigned long long int o = 1; o <= n; o++)
			{
				dp[o] = 2 * dp[o - 1];

				if (last[bitSeq[o - 1]] != (unsigned long long int) - 1)
				{
					dp[o] = dp[o] - dp[last[bitSeq[o - 1]]];
				}

				last[bitSeq[o - 1]] = (o - 1);
			}
			subCount = dp[n] - 1;
		}
		/*
		while (subCount > k)
		{
			bitSeq[l] = '1';

			vector<unsigned long long int>last(MAX_CHAR, -1);

			const unsigned long long int n = bitSeq.length();

			unsigned long long int* dp = new unsigned long long int[n + 1];
			dp[0] = 1;

			for (unsigned long long int o = 1; o <= n; o++)
			{
				dp[o] = 2 * dp[o - 1];

				if (last[bitSeq[o - 1]] != (unsigned long long int) - 1)
				{
					dp[o] = dp[o] - dp[last[bitSeq[o - 1]]];
				}

				last[bitSeq[o - 1]] = (o - 1);
			}
			subCount = dp[n] - 1;
			l -= 2;
		}
		std::cout << bitSeq << "\n";
		*/

		i = stoi(bitSeq, nullptr, 2);
	}

	while (subCount != k)
	{
		complexity++;
		i++;
		bitSeq = bitset<SEQUENCE_SIZE>(i).to_string().substr(bitset<SEQUENCE_SIZE>(i).to_string().find("1", 0));

		vector<unsigned long long int>last(MAX_CHAR, -1);

		const unsigned long long int n = bitSeq.length();

		unsigned long long int* dp = new unsigned long long int[n + 1];
		dp[0] = 1;

		for (unsigned long long int o = 1; o <= n; o++)
		{
			dp[o] = 2 * dp[o - 1];

			if (last[bitSeq[o - 1]] != (unsigned long long int) - 1)
			{
				dp[o] = dp[o] - dp[last[bitSeq[o - 1]]];
			}

			last[bitSeq[o - 1]] = (o - 1);
		}
		subCount = dp[n] - 1;
	}
	std::cout << bitSeq << "\n";
	std::cout << complexity << "\n";

	int a = 0;
	std::cin >> a;
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`1` view save

correct output
`1` view save

user output
`1 1` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`2` view save

correct output
`11` view save

user output
`11 3` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`3` view save

correct output
`10` view save

user output
`10 2` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`4` view save

correct output
`1111` view save

user output
`1111 15` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`110` view save

user output
`100 4` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`101` view save

user output
`101 5` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`1110` view save

user output
`1000 8` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`8` view save

correct output
`1100` view save

user output
`1100 12` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`9` view save

correct output
`1101` view save

user output
`1011 11` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`1001` view save

user output
`1001 9` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`38` view save

correct output
`1101011` view save

user output
`1101011 107` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`13` view save

correct output
`11011` view save

user output
`11011 27` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`90` view save

correct output
`111001010` view save

user output
`100100010 290` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`25` view save

correct output
`110010` view save

user output
`101100 44` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`82` view save

correct output
`111001101` view save

user output
`100010011 275` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`94` view save

correct output
`1100011110` view save

user output
`1000011100 540` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`100` view save

correct output
`1111001001` view save

user output
`1001001111 591` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`99` view save

correct output
`110010010` view save

user output
`100011010 282` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`98` view save

correct output
`110110010` view save

user output
`100111010 314` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`92` view save

correct output
`100110001` view save

user output
`100011001 281` view save

Test 21

Group: 3

Verdict: ACCEPTED

input
`1666` view save

correct output
`101101100100101` view save

user output
`100100010101010 18602` view save

Test 22

Group: 3

Verdict: ACCEPTED

input
`897` view save

correct output
`11101001101010` view save

user output
`10100010110100 10420` view save

Test 23

Group: 3

Verdict: ACCEPTED

input
`4466` view save

correct output
`111101010110100101` view save

user output
`101001001110001011 40502` view save

Test 24

Group: 3

Verdict: WRONG ANSWER

input
`4240` view save

correct output
`11011001011010101` view save

user output
`101000011001010011 37118` view save

Test 25

Group: 3

Verdict: WRONG ANSWER

input
`3089` view save

correct output
`1011001010100101` view save

user output
`10001010100010100 10858` view save

Test 26

Group: 3

Verdict: WRONG ANSWER

input
`4697` view save

correct output
`11010101101010110` view save

user output
`100010011011010011 20862` view save

Test 27

Group: 3

Verdict: WRONG ANSWER

input
`4608` view save

correct output
`11010110101001010` view save

user output
`100011011010011101 24904` view save

Test 28

Group: 3

Verdict: ACCEPTED

input
`4625` view save

correct output
`111011001100101001` view save

user output
`100010101110110110 22113` view save

Test 29

Group: 3

Verdict: WRONG ANSWER

input
`4611` view save

correct output
`11010101010101100` view save

user output
`100000101010101010 13653` view save

Test 30

Group: 3

Verdict: WRONG ANSWER

input
`4917` view save

correct output
`10110100101010110` view save

user output
`100010011010101110 20825` view save

Test 31

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
(empty)

Test 32

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`864856` view save

correct output
`10111010110110100100101010010` view save

user output
(empty)

Test 33

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`112146` view save

correct output
`1101110101011001100100110` view save

user output
(empty)

Test 34

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`741124` view save

correct output
`1011010011010101100101011010` view save

user output
(empty)

Test 35

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`511902` view save

correct output
`1011010100011010100101001110` view save

user output
(empty)

Test 36

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`920019` view save

correct output
`11100100101101010101001101010` view save

user output
(empty)

Test 37

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`933943` view save

correct output
`10101011010100100110100111001` view save

user output
(empty)

Test 38

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`973410` view save

correct output
`1011010101011010101010101001` view save

user output
(empty)

Test 39

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`954943` view save

correct output
`10110110010011010100100110101` view save

user output
(empty)

Test 40

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`911674` view save

correct output
`1010110010110101010101010110` view save

user output
(empty)

Datatähti 2018 alku

Bittijono

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

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Tasks

Submissions (SeveriK)