CSES - Datatähti 2018 alku

CSES - Datatähti 2018 alku - Results

Submission details
Task:	Bittijono
Sender:	Yytsi
Submission time:	2017-10-04 17:51:45 +0300
Language:	C++
Status:	READY
Result:	0

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

Test results
test	verdict	time	group
#1	TIME LIMIT EXCEEDED	--	1	details
#2	TIME LIMIT EXCEEDED	--	1	details
#3	TIME LIMIT EXCEEDED	--	1	details
#4	TIME LIMIT EXCEEDED	--	1	details
#5	TIME LIMIT EXCEEDED	--	1	details
#6	TIME LIMIT EXCEEDED	--	1	details
#7	TIME LIMIT EXCEEDED	--	1	details
#8	TIME LIMIT EXCEEDED	--	1	details
#9	TIME LIMIT EXCEEDED	--	1	details
#10	TIME LIMIT EXCEEDED	--	1	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	WRONG ANSWER	0.98 s	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	WRONG ANSWER	1.00 s	2	details
#15	TIME LIMIT EXCEEDED	--	2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	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	TIME LIMIT EXCEEDED	--	3	details
#28	TIME LIMIT EXCEEDED	--	3	details
#29	TIME LIMIT EXCEEDED	--	3	details
#30	TIME LIMIT EXCEEDED	--	3	details
#31	WRONG ANSWER	0.99 s	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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:158:25: warning: statement has no effect [-Wunused-value]
     if (res == "fail") 0;//cout << "Length of " << j << " failed!\n";
                         ^
input/code.cpp:139:6: warning: unused variable 'high' [-Wunused-variable]
  int high = len + 2;
      ^

Code

#include <iostream>
#include <string>
#include <algorithm>
 
using namespace std;
int n;
string solution = "not found";
 
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(const 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;
}
 
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 tries)
{
	for (int test = 0; test < tries; test++)
	{
		int maxFitness = 123456879, fitIndex = -1;
		while (true)
		{
			bool foundImprovement = false;
			for (size_t i = 1; 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() + 1, 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";
	n = 750123;
	bool found = false;
	string chains[30]={"10101010101010101010101010101", "10010010010010010010010010011",
					   "10001000100010001000100010001", "10000101001010010000101001000",
					   "10000010000010000010000010001", "10011001100110011001100110010",
					   "10110110110110110110110110111", "11111111111111111111111111111",
					   "11111000001111100000111110001", "10100101001010010100101001010",
					   "11001100110011001100110011001", "10011100001111100000011111110",
					   "11110000111100001111000011111", "10010100101001010010100101000",
					   "11101110111011101110111011100", "11101001110010010111000110011",
					   "10010110010010110010001001100", "10010011000101101101101001001",
					   "11111100000000000000000000000", "00010011000101101101101001001",
					   "10100101010101010011010110110", "00100101001101010101010110101",
					   "11011010110010101010101001010", "01011010101010101100101001000",
					   "10100100100100101101011010110", "10100100100100101101011010110",
					   "01011011011011010010100101001", "11011011011011010010100101001",
					   "01101001101100110100101001010", "11101001101100110100101001010"};
	
	
	
	int len = binSizeLowerBound(n);
	int low = len + 1;
	int high = len + 2;
	
	for (int i = 0; i < 27; i++)
		if (bounds[i] == n) found = true;
	
	bool foundAns = false;
	if (n == 1) cout << "1";
	else if (found) cout << chains[0].substr(0, low);
	else
	{
		for (int i = 0; i < 30; i++)
		{
			string chain = chains[i];
			
			for (int j = low; j < 29; j++)
			{
				string sub = chain.substr(0, j);
				
				string res = findBitstring(sub, 3000);
				if (res == "fail") 0;//cout << "Length of " << j << " failed!\n";
				else
				{
					// Found an answer....
					cout << res << "\n";
					foundAns = true;
					break;
				}
			}
			
			if (foundAns) 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: TIME LIMIT EXCEEDED

input
`1` view save

correct output
`1` view save

user output
(empty)

Test 2

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`2` view save

correct output
`11` view save

user output
(empty)

Test 3

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`3` view save

correct output
`10` view save

user output
(empty)

Test 4

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`4` view save

correct output
`1111` view save

user output
(empty)

Test 5

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`5` view save

correct output
`110` view save

user output
(empty)

Test 6

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`6` view save

correct output
`101` view save

user output
(empty)

Test 7

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`7` view save

correct output
`1110` view save

user output
(empty)

Test 8

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`8` view save

correct output
`1100` view save

user output
(empty)

Test 9

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`9` view save

correct output
`1101` view save

user output
(empty)

Test 10

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`10` view save

correct output
`1001` view save

user output
(empty)

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`38` view save

correct output
`1101011` view save

user output
(empty)

Test 12

Group: 2

Verdict: WRONG ANSWER

input
`13` view save

correct output
`11011` view save

user output
`1101101011001010101010100101` view save

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`90` view save

correct output
`111001010` view save

user output
(empty)

Test 14

Group: 2

Verdict: WRONG ANSWER

input
`25` view save

correct output
`110010` view save

user output
`1101101011001010101010100101` view save

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`82` view save

correct output
`111001101` view save

user output
(empty)

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`94` view save

correct output
`1100011110` view save

user output
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100` view save

correct output
`1111001001` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`99` view save

correct output
`110010010` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`98` view save

correct output
`110110010` view save

user output
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`92` view save

correct output
`100110001` view save

user output
(empty)

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1666` view save

correct output
`101101100100101` view save

user output
(empty)

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`897` view save

correct output
`11101001101010` view save

user output
(empty)

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4466` view save

correct output
`111101010110100101` view save

user output
(empty)

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4240` view save

correct output
`11011001011010101` view save

user output
(empty)

Test 25

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`3089` view save

correct output
`1011001010100101` view save

user output
(empty)

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4697` view save

correct output
`11010101101010110` view save

user output
(empty)

Test 27

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4608` view save

correct output
`11010110101001010` view save

user output
(empty)

Test 28

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4625` view save

correct output
`111011001100101001` view save

user output
(empty)

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4611` view save

correct output
`11010101010101100` view save

user output
(empty)

Test 30

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4917` view save

correct output
`10110100101010110` view save

user output
(empty)

Test 31

Group: 4

Verdict: WRONG ANSWER

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
`1101101011001010101010100101` view save

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

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)