CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:Yytsi
Submission time:2017-10-03 23:38:05 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#20.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#50.04 s1details
#6ACCEPTED0.05 s1details
#70.04 s1details
#80.04 s1details
#90.05 s1details
#100.05 s1details
#110.05 s2details
#120.06 s2details
#130.03 s2details
#140.05 s2details
#15ACCEPTED0.04 s2details
#16ACCEPTED0.05 s2details
#17ACCEPTED0.05 s2details
#180.04 s2details
#190.04 s2details
#200.05 s2details
#210.04 s3details
#22ACCEPTED0.04 s3details
#23ACCEPTED0.04 s3details
#240.04 s3details
#250.05 s3details
#260.03 s3details
#270.05 s3details
#28ACCEPTED0.05 s3details
#290.05 s3details
#300.05 s3details
#310.12 s4details
#320.13 s4details
#330.09 s4details
#34ACCEPTED0.04 s4details
#350.11 s4details
#36ACCEPTED0.05 s4details
#370.12 s4details
#380.16 s4details
#39ACCEPTED0.14 s4details
#400.13 s4details

Code

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

using namespace std;

bool searchTrackedResult = false;
string solution = "";
int 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 target)
{
	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 (target == distinct)
		{
			searchTrackedResult = true;
			solution = str;
		}
		if (isOne) ones = newSum;
		else zeros = newSum;
	}
	
	return distinct;
}

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

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


string findBitstring(string b, int n, int tries)
{
	for (int test = 0; test < tries; 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, n);
				if (searchTrackedResult) return solution;
				//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());
				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]={"10101010101010101010101010101", "10010010010010010010010010011",
					   "10001000100010001000100010001", "10000100001000010000100001000",
					   "10000010000010000010000010001", "10011001100110011001100110010",
					   "10110110110110110110110110111", "11111111111111111111111111111",
					   "11111000001111100000111110001", "10100101001010010100101001010",
					   "11001100110011001100110011001", "10011100001111100000011111110",
					   "11110000111100001111000011111", "10010100101001010010100101000",
					   "11101110111011101110111011100", "11101001110010010111000110011",
					   "10010110010010110010001001100", "10010011000101101101101001001",
					   "00010110010010110010001001100", "00010011000101101101101001001",
					   "10100101010101010011010110110", "00100101001101010101010110101",
					   "11011010110010101010101001010", "01011010101010101100101001000",
					   "10100100100100101101011010110", "10100100100100101101011010110",
					   "01011011011011010010100101001", "11011011011011010010100101001",
					   "01101001101100110100101001010", "11101001101100110100101001010"};
	
	
	
	int len = binSizeLowerBound(n);
	int high = len + 2;
	
	for (int i = 0; i < 27; i++)
		if (bounds[i] == n) found = true;
	
	
	if (n == 1) cout << "1";
	else if (found) cout << chains[0].substr(0, len + 1);
	else
	{
		for (int i = 0; i < 30; i++)
		{
			string p = chains[i].substr(0, high);
			string res = findBitstring(p, n, 100);
			if (res != "fail")
			{
				cout << res;
				break;
			}
		}		
	}
	
	/*
	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

correct output
1

user output
1

Test 2

Group: 1

Verdict:

input
2

correct output
11

user output
001

Test 3

Group: 1

Verdict: ACCEPTED

input
3

correct output
10

user output
10

Test 4

Group: 1

Verdict: ACCEPTED

input
4

correct output
1111

user output
1111

Test 5

Group: 1

Verdict:

input
5

correct output
110

user output
0010

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
101

Test 7

Group: 1

Verdict:

input
7

correct output
1110

user output
11101

Test 8

Group: 1

Verdict:

input
8

correct output
1100

user output
11001

Test 9

Group: 1

Verdict:

input
9

correct output
1101

user output
00101

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
01101

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
00001001

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
110110

Test 13

Group: 2

Verdict:

input
90

correct output
111001010

user output
1100110000

Test 14

Group: 2

Verdict:

input
25

correct output
110010

user output
1100101

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
100010011

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
0111100011

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
0000110110

Test 18

Group: 2

Verdict:

input
99

correct output
110010010

user output
0100100110

Test 19

Group: 2

Verdict:

input
98

correct output
110110010

user output
0100110110

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
0110011101

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
1100001100101101

Test 22

Group: 3

Verdict: ACCEPTED

input
897

correct output
11101001101010

user output
00100100110010

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
101001011010101111

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
111001011001101100

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
11101010110110100

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
110010011100110010

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
001110010110100100

Test 28

Group: 3

Verdict: ACCEPTED

input
4625

correct output
111011001100101001

user output
010011001011110101

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
110010101010101000

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
101101101001100011

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: ACCEPTED

input
741124

correct output
1011010011010101100101011010

user output
1010010101100101010011010010

Test 35

Group: 4

Verdict:

input
511902

correct output
1011010100011010100101001110

user output
(empty)

Test 36

Group: 4

Verdict: ACCEPTED

input
920019

correct output
11100100101101010101001101010

user output
11001011010100101100100101101

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: ACCEPTED

input
954943

correct output
10110110010011010100100110101

user output
01010011011010100110110010010

Test 40

Group: 4

Verdict:

input
911674

correct output
1010110010110101010101010110

user output
(empty)