CSES - Datatähti 2018 alku

CSES - Datatähti 2018 alku - Results

Submission details
Task:	Bittijono
Sender:	Yytsi
Submission time:	2017-10-04 01:22:00 +0300
Language:	C++
Status:	READY
Result:	7

Feedback
group	verdict	score
#1	ACCEPTED	7
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.05 s	1	details
#2	ACCEPTED	0.05 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.06 s	1	details
#5	ACCEPTED	0.05 s	1	details
#6	ACCEPTED	0.05 s	1	details
#7	ACCEPTED	0.04 s	1	details
#8	ACCEPTED	0.04 s	1	details
#9	ACCEPTED	0.05 s	1	details
#10	ACCEPTED	0.04 s	1	details
#11	WRONG ANSWER	0.09 s	2	details
#12	WRONG ANSWER	0.08 s	2	details
#13	WRONG ANSWER	0.10 s	2	details
#14	ACCEPTED	0.04 s	2	details
#15	WRONG ANSWER	0.10 s	2	details
#16	WRONG ANSWER	0.08 s	2	details
#17	WRONG ANSWER	0.10 s	2	details
#18	ACCEPTED	0.03 s	2	details
#19	ACCEPTED	0.05 s	2	details
#20	WRONG ANSWER	0.12 s	2	details
#21	ACCEPTED	0.03 s	3	details
#22	WRONG ANSWER	0.22 s	3	details
#23	ACCEPTED	0.15 s	3	details
#24	ACCEPTED	0.10 s	3	details
#25	ACCEPTED	0.05 s	3	details
#26	ACCEPTED	0.04 s	3	details
#27	ACCEPTED	0.04 s	3	details
#28	ACCEPTED	0.13 s	3	details
#29	ACCEPTED	0.04 s	3	details
#30	ACCEPTED	0.06 s	3	details
#31	ACCEPTED	0.30 s	4	details
#32	ACCEPTED	0.44 s	4	details
#33	WRONG ANSWER	0.44 s	4	details
#34	ACCEPTED	0.48 s	4	details
#35	WRONG ANSWER	0.55 s	4	details
#36	ACCEPTED	0.39 s	4	details
#37	ACCEPTED	0.37 s	4	details
#38	ACCEPTED	0.05 s	4	details
#39	ACCEPTED	0.49 s	4	details
#40	ACCEPTED	0.05 s	4	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:168:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (bounds[i] == n) found = true;
                    ^

Code

// WARNING: Super ugly code ahead. Beware.
// Even contains debugging traces, hrr :-P












#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

size_t bounds[27] = {1, 3, 6, 11, 19, 32, 53, 87, 142, 231, 375, 608, 985, 1595, 2582, 4179,
              6763, 10944, 17709, 28655, 46366, 75023, 121391, 196416, 317809, 514227, 832038};

int numberOfDistinct(string str)
{
	int ones = 0;
	int zeros = 0;
	int distinct = 0;
	
	for (size_t i = 0; i < str.length(); i++)
	{
		char bit = str[i];
		bool isOne = bit == '1';
		
		int newSum = 1 + distinct;
		distinct = distinct - (isOne ? ones : zeros) + newSum;
		if (isOne) ones = newSum;
		else zeros = newSum;
	}
	
	return distinct;
}

size_t binSizeLowerBound(size_t n)
{
	for (int i = 26; i != 0; i--)
	{
		size_t bound = bounds[i];
		if (bound < n)
		{
			return i + 1;
		}
	}
	return 1;
}

string convertToBitString(size_t value)
{
	string str(33, '0');
	
	for (size_t i = 0; i < 33; i++)
	{
		if ((1LL << i) & value)
			str[32 - i] = '1';
	}
	str = str.substr(str.find_first_not_of("0"));
	
	return str;
}


string findBitstring(string b, int n, size_t portions, size_t lowerBound, size_t upperBound)
{
	size_t space = upperBound - lowerBound;
	size_t slice = space / portions;
	for (size_t test = 0; test < (portions + 1); test++)
	{
		int maxFitness = 123456879, fitIndex = -1;
		while (true)
		{
			bool foundImprovement = false;
			for (size_t i = 0; i < b.size(); i++)
			{
				char bit = b[i];
				char rev = "01"[bit == '0'];
				b[i] = rev;
				
				int distinctSubs = numberOfDistinct(b);
				//cout << b << " : " << distinctSubs << "\n";
				
				int fitness = abs(distinctSubs - n);
				if (fitness == 0)
				{
					// Solution found.
					return b;
				}
				if (fitness < maxFitness)
				{
					maxFitness = fitness;
					fitIndex = (int)i;
					foundImprovement = true;
				}
				
				b[i] = bit;
			}
			
			if (foundImprovement) b[fitIndex] = "01"[b[fitIndex] == '0'];
			else
			{
				//cout << "No improvement found :-( shuffling\n";
				// random_shuffle(b.begin(), b.end());
				
				b = convertToBitString(lowerBound);
				//cout << "lowerBound: " << b << "\n";
				lowerBound += slice;
				break;
			}
		}
	}
	return "fail";
}


int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	/*
	long n;
	cin >> n;*/
	//int base = (int)log2(n);
	
	//cout << base << "\n";
	int n;
	cin >> n;
	
	bool found = false;
	string chains[30]={"1010101010101010101010101010101", "1001001001001001001001001001101",
					   "1000100010001000100010001000101", "1000010000100001000010000100001",
					   "1000001000001000001000001000101", "1001100110011001100110011001001",
					   "1011011011011011011011011011101", "1111111111111111111111111111101",
					   "1111100000111110000011111000101", "1010010100101001010010100101001",
					   "1100110011001100110011001100101", "1001110000111110000001111111001",
					   "1111000011110000111100001111101", "1001010010100101001010010100001",
					   "1110111011101110111011101110001", "1110100111001001011100011001101",
					   "1001011001001011001000100110001", "1001001100010110110110100100101",
					   "0001011001001011001000100110001", "0001001100010110110110100100101",
					   "1010010101010101001101011011001", "0010010100110101010101011010101",
					   "1101101011001010101010100101001", "0101101010101010110010100100001",
					   "1010010010010010110101101011001", "1010010010010010110101101011001",
					   "0101101101101101001010010100101", "1101101101101101001010010100101",
					   "0110100110110011010010100101001", "1110100110110011010010100101001"};
	
	
	
	size_t len = binSizeLowerBound(n);
	size_t low = len + 1;
	size_t high = len + 2;
	
	string a = convertToBitString(1 << len);
	string b = convertToBitString(1 << high);
	
	//cout << a << " " << b << "\n";
	
	
	for (size_t i = 0; i < 27; i++)
		if (bounds[i] == n) found = true;
	
	
	if (n == 1) cout << "1";
	else if (found) cout << chains[0].substr(0, low);
	else
	{
		for (int i = 0; i < 1; i++)
		{
			size_t a1 = 1 << len;
			size_t b1 = 1 << (len + 1);
			size_t a2 = 1 << (len + 1);
			size_t b2 = 1 << (len + 2);
			
			//cout << a1 << " " << b1 << " : " << a2 << " " << b2 << "\n";
			
			string p1 = chains[i].substr(0, low);
			string p2 = chains[i].substr(0, high);
			
			string res = findBitstring(p1, n, 10000, a1, b1);
			if (res == "fail")
			{
				res = findBitstring(p2, n, 10000, a2, b2);
			}
			
			if (res != "fail")
			{
				cout << res;
			}
		}
	}
	
	/*
	cout << findBitstring("010101010100000001010101010", 832038, 1000) << "\n";
	cout << findBitstring("100010001000100010001000100", 832038, 1000) << "\n";
	cout << findBitstring("010101010100000001010101010", 832038, 1000) << "\n";
	cout << findBitstring("010101010100000001010101010", 832038, 1000) << "\n";*/

	
	//cout << m << "\n";
	//cout << numberOfDistinct(str) << "\n";
	
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`1` view save

correct output
`1` view save

user output
`1` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`2` view save

correct output
`11` view save

user output
`00` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`3` view save

correct output
`10` view save

user output
`10` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`4` view save

correct output
`1111` view save

user output
`1111` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`110` view save

user output
`001` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`101` view save

user output
`101` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`1110` view save

user output
`1110` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`8` view save

correct output
`1100` view save

user output
`0011` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`9` view save

correct output
`1101` view save

user output
`0010` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`1001` view save

user output
`0110` view save

Test 11

Group: 2

Verdict: WRONG ANSWER

input
`38` view save

correct output
`1101011` view save

user output
`10010000` view save

Test 12

Group: 2

Verdict: WRONG ANSWER

input
`13` view save

correct output
`11011` view save

user output
(empty)

Test 13

Group: 2

Verdict: WRONG ANSWER

input
`90` view save

correct output
`111001010` view save

user output
(empty)

Test 14

Group: 2

Verdict: ACCEPTED

input
`25` view save

correct output
`110010` view save

user output
`101100` view save

Test 15

Group: 2

Verdict: WRONG ANSWER

input
`82` view save

correct output
`111001101` view save

user output
(empty)

Test 16

Group: 2

Verdict: WRONG ANSWER

input
`94` view save

correct output
`1100011110` view save

user output
(empty)

Test 17

Group: 2

Verdict: WRONG ANSWER

input
`100` view save

correct output
`1111001001` view save

user output
(empty)

Test 18

Group: 2

Verdict: ACCEPTED

input
`99` view save

correct output
`110010010` view save

user output
`101101100` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`98` view save

correct output
`110110010` view save

user output
`101100100` view save

Test 20

Group: 2

Verdict: WRONG ANSWER

input
`92` view save

correct output
`100110001` view save

user output
(empty)

Test 21

Group: 3

Verdict: ACCEPTED

input
`1666` view save

correct output
`101101100100101` view save

user output
`101101100100101` view save

Test 22

Group: 3

Verdict: WRONG ANSWER

input
`897` view save

correct output
`11101001101010` view save

user output
(empty)

Test 23

Group: 3

Verdict: ACCEPTED

input
`4466` view save

correct output
`111101010110100101` view save

user output
`110010110100100111` view save

Test 24

Group: 3

Verdict: ACCEPTED

input
`4240` view save

correct output
`11011001011010101` view save

user output
`10101011010011011` view save

Test 25

Group: 3

Verdict: ACCEPTED

input
`3089` view save

correct output
`1011001010100101` view save

user output
`1010010101001101` view save

Test 26

Group: 3

Verdict: ACCEPTED

input
`4697` view save

correct output
`11010101101010110` view save

user output
`10010101001010100` view save

Test 27

Group: 3

Verdict: ACCEPTED

input
`4608` view save

correct output
`11010110101001010` view save

user output
`10101101010010100` view save

Test 28

Group: 3

Verdict: ACCEPTED

input
`4625` view save

correct output
`111011001100101001` view save

user output
`100101000110111001` view save

Test 29

Group: 3

Verdict: ACCEPTED

input
`4611` view save

correct output
`11010101010101100` view save

user output
`10101101011010100` view save

Test 30

Group: 3

Verdict: ACCEPTED

input
`4917` view save

correct output
`10110100101010110` view save

user output
`10010101011010010` view save

Test 31

Group: 4

Verdict: ACCEPTED

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
`1001001010101001001010010` view save

Test 32

Group: 4

Verdict: ACCEPTED

input
`864856` view save

correct output
`10111010110110100100101010010` view save

user output
`10100110001101010100110010010` view save

Test 33

Group: 4

Verdict: WRONG ANSWER

input
`112146` view save

correct output
`1101110101011001100100110` view save

user output
(empty)

Test 34

Group: 4

Verdict: ACCEPTED

input
`741124` view save

correct output
`1011010011010101100101011010` view save

user output
`1011010011010101100101011010` view save

Test 35

Group: 4

Verdict: WRONG ANSWER

input
`511902` view save

correct output
`1011010100011010100101001110` view save

user output
(empty)

Test 36

Group: 4

Verdict: ACCEPTED

input
`920019` view save

correct output
`11100100101101010101001101010` view save

user output
`10100101010101110001010011010` view save

Test 37

Group: 4

Verdict: ACCEPTED

input
`933943` view save

correct output
`10101011010100100110100111001` view save

user output
`10101011010100100110100111001` view save

Test 38

Group: 4

Verdict: ACCEPTED

input
`973410` view save

correct output
`1011010101011010101010101001` view save

user output
`1001010101010101101010101101` view save

Test 39

Group: 4

Verdict: ACCEPTED

input
`954943` view save

correct output
`10110110010011010100100110101` view save

user output
`10101100100101011001001101101` view save

Test 40

Group: 4

Verdict: ACCEPTED

input
`911674` view save

correct output
`1010110010110101010101010110` view save

user output
`1001010101010101001011001010` view save

Datatähti 2018 alku

Bittijono

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

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 (Yytsi)