CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:SeveriK
Submission time:2017-10-11 01:34:06 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#20.24 s1details
#30.04 s1details
#40.07 s1details
#50.21 s1details
#60.04 s1details
#70.19 s1details
#80.05 s1details
#90.21 s1details
#100.20 s1details
#110.19 s2details
#120.19 s2details
#130.19 s2details
#140.19 s2details
#150.20 s2details
#160.24 s2details
#170.22 s2details
#180.23 s2details
#190.21 s2details
#200.20 s2details
#21ACCEPTED0.06 s3details
#220.21 s3details
#23ACCEPTED0.12 s3details
#24ACCEPTED0.08 s3details
#25ACCEPTED0.06 s3details
#26ACCEPTED0.08 s3details
#27ACCEPTED0.06 s3details
#28ACCEPTED0.07 s3details
#29ACCEPTED0.08 s3details
#30ACCEPTED0.09 s3details
#31--4details
#320.97 s4details
#330.88 s4details
#340.97 s4details
#350.88 s4details
#36--4details
#370.75 s4details
#380.95 s4details
#390.87 s4details
#400.94 s4details

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 = 32;

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

	unsigned long long int k = 0;
	std::cin >> k;

	if (k == 0)
	{
		std::cout << "\n";
	}
	else if (k == 1)
	{
		std::cout << 0 << "\n";
	}
	else
	{
		if (k > 999)
		{

			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;
			}
			l--;
			if (bitSeq[l] == '1')
			{
				l--;
			}
			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;
			}

			subCount = 0;
		}

		unsigned long long int l = bitSeq.length();
		while (subCount != k)
		{
			for (unsigned long long int b = l - 1; b >= 0; b--)
			{
				if (bitSeq[b] != '1')
				{
					bitSeq[b] = '1';
					for (unsigned long long int c = b + 1; c < l; c++)
					{
						bitSeq[c] = '0';
					}
					break;
				}
				else if (b == 0)
				{
					bitSeq = "1";
					bitSeq += string(l, '0');
					l++;
					break;
				}
			}

			const unsigned long long int n = l;

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

			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";
	}

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

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
0

Test 2

Group: 1

Verdict:

input
2

correct output
11

user output
(empty)

Test 3

Group: 1

Verdict:

input
3

correct output
10

user output
110

Test 4

Group: 1

Verdict:

input
4

correct output
1111

user output
1110

Test 5

Group: 1

Verdict:

input
5

correct output
110

user output
(empty)

Test 6

Group: 1

Verdict:

input
6

correct output
101

user output
1111

Test 7

Group: 1

Verdict:

input
7

correct output
1110

user output
(empty)

Test 8

Group: 1

Verdict:

input
8

correct output
1100

user output
1001

Test 9

Group: 1

Verdict:

input
9

correct output
1101

user output
(empty)

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
(empty)

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
(empty)

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
(empty)

Test 13

Group: 2

Verdict:

input
90

correct output
111001010

user output
(empty)

Test 14

Group: 2

Verdict:

input
25

correct output
110010

user output
(empty)

Test 15

Group: 2

Verdict:

input
82

correct output
111001101

user output
(empty)

Test 16

Group: 2

Verdict:

input
94

correct output
1100011110

user output
(empty)

Test 17

Group: 2

Verdict:

input
100

correct output
1111001001

user output
(empty)

Test 18

Group: 2

Verdict:

input
99

correct output
110010010

user output
(empty)

Test 19

Group: 2

Verdict:

input
98

correct output
110110010

user output
(empty)

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
(empty)

Test 21

Group: 3

Verdict: ACCEPTED

input
1666

correct output
101101100100101

user output
100100010101010

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
(empty)

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
101001001110001011

Test 24

Group: 3

Verdict: ACCEPTED

input
4240

correct output
11011001011010101

user output
10101011010011011

Test 25

Group: 3

Verdict: ACCEPTED

input
3089

correct output
1011001010100101

user output
1010010101001101

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
10010101001010100

Test 27

Group: 3

Verdict: ACCEPTED

input
4608

correct output
11010110101001010

user output
10101101010010100

Test 28

Group: 3

Verdict: ACCEPTED

input
4625

correct output
111011001100101001

user output
100010101110110110

Test 29

Group: 3

Verdict: ACCEPTED

input
4611

correct output
11010101010101100

user output
10101101011010100

Test 30

Group: 3

Verdict: ACCEPTED

input
4917

correct output
10110100101010110

user output
10010101011010010

Test 31

Group: 4

Verdict:

input
178555

correct output
1011010110110101010110110

user output
(empty)

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
(empty)

Test 33

Group: 4

Verdict:

input
112146

correct output
1101110101011001100100110

user output
(empty)

Test 34

Group: 4

Verdict:

input
741124

correct output
1011010011010101100101011010

user output
(empty)

Test 35

Group: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
(empty)

Test 36

Group: 4

Verdict:

input
920019

correct output
11100100101101010101001101010

user output
(empty)

Test 37

Group: 4

Verdict:

input
933943

correct output
10101011010100100110100111001

user output
(empty)

Test 38

Group: 4

Verdict:

input
973410

correct output
1011010101011010101010101001

user output
(empty)

Test 39

Group: 4

Verdict:

input
954943

correct output
10110110010011010100100110101

user output
(empty)

Test 40

Group: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
(empty)