CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:mika
Submission time:2017-10-12 16:37:00 +0300
Language:C++
Status:READY
Result:49
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#3ACCEPTED27
#40
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.04 s1details
#11ACCEPTED0.06 s2details
#12ACCEPTED0.05 s2details
#13ACCEPTED0.05 s2details
#14ACCEPTED0.05 s2details
#15ACCEPTED0.04 s2details
#16ACCEPTED0.04 s2details
#17ACCEPTED0.05 s2details
#18ACCEPTED0.07 s2details
#19ACCEPTED0.06 s2details
#20ACCEPTED0.04 s2details
#21ACCEPTED0.05 s3details
#22ACCEPTED0.05 s3details
#23ACCEPTED0.08 s3details
#24ACCEPTED0.06 s3details
#25ACCEPTED0.05 s3details
#26ACCEPTED0.04 s3details
#27ACCEPTED0.06 s3details
#28ACCEPTED0.07 s3details
#29ACCEPTED0.07 s3details
#30ACCEPTED0.08 s3details
#31--4details
#32--4details
#33--4details
#34--4details
#35--4details
#36--4details
#37--4details
#38--4details
#39--4details
#40--4details

Compiler report

input/code.cpp: In function 'int alijonoc(std::string)':
input/code.cpp:16:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < s.length(); i++)
                               ^
input/code.cpp:19:18: warning: array subscript has type 'char' [-Wchar-subscripts]
   c = c - cc[s[i]] + ccc;
                  ^
input/code.cpp:20:10: warning: array subscript has type 'char' [-Wchar-subscripts]
   cc[s[i]] = ccc;
          ^
input/code.cpp: In function 'int lenn(int)':
input/code.cpp:31:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < rajat.size(); i++)
                                 ^

Code

#include <iostream>
#include <string>
#include <vector>
#include <ctime>
#include <bitset>
#include <math.h>
#include <set>

#define MAX_N 1000000
using namespace std;

int alijonoc(string s)
{
	int c = 0;
	int cc[256] = { 0 };
	for (int i = 0; i < s.length(); i++)
	{
		int ccc = 1 + c;
		c = c - cc[s[i]] + ccc;
		cc[s[i]] = ccc;
	}
	return c;
}

vector<int> rajat(MAX_N);

// min length
int lenn(int n)
{
	int len = 1;
	for (int i = 0; i < rajat.size(); i++)
	{
		if (rajat[i] - 1 >= n) {
			len = i;
			break;
		}
	}
	return len + 1;
}

void fill_rajat()
{
	// rajat[n] = 1+ n[n-1] + [n-2]
	rajat[0] = 2;
	rajat[1] = 4;

	for (int i = 2; i < MAX_N; i++)
	{
		rajat[i] = 1 + rajat[i - 1] + rajat[i - 2];
		if (rajat[i] > MAX_N)
			break;
	}
}

string str(int n, int len, int stackguard = 0)
{
	if (stackguard > 10)
		return "";
	//long max = pow(2, len) / (len - 2);
	long max = pow(2, len) / 2;
	for (int i = 0; i < max; i++)
	{
		bitset<32> bit = i;
		string s = bit.to_string();
		s.erase(s.begin(), s.end() - len);

		int c = alijonoc(s);
		if (c == n)
			return s;
	}
	return str(n, len + 1, stackguard + 1);
}

int main()
{
	fill_rajat();

	/*for (int i = 0; i < rajat.size(); i++)
		if (rajat[i] != 0)
			cout << rajat[i] << " ";
	cout << endl;*/

	int n;
	cin >> n;
	cout << str(n, lenn(n)) << "\n";
	//system("pause");
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
0

Test 2

Group: 1

Verdict: ACCEPTED

input
2

correct output
11

user output
00

Test 3

Group: 1

Verdict: ACCEPTED

input
3

correct output
10

user output
01

Test 4

Group: 1

Verdict: ACCEPTED

input
4

correct output
1111

user output
0000

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
110

user output
001

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
010

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
0001

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
1100

user output
0011

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
0010

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
0110

Test 11

Group: 2

Verdict: ACCEPTED

input
38

correct output
1101011

user output
0010100

Test 12

Group: 2

Verdict: ACCEPTED

input
13

correct output
11011

user output
00100

Test 13

Group: 2

Verdict: ACCEPTED

input
90

correct output
111001010

user output
000110101

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
001101

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
000110010

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
0011100001

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
0000110110

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
001101101

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
001001101

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
011001110

Test 21

Group: 3

Verdict: ACCEPTED

input
1666

correct output
101101100100101

user output
010010011011010

Test 22

Group: 3

Verdict: ACCEPTED

input
897

correct output
11101001101010

user output
00010110010101

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
000010101001011010

Test 24

Group: 3

Verdict: ACCEPTED

input
4240

correct output
11011001011010101

user output
00100110100101010

Test 25

Group: 3

Verdict: ACCEPTED

input
3089

correct output
1011001010100101

user output
0100110101011010

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
00101010010101001

Test 27

Group: 3

Verdict: ACCEPTED

input
4608

correct output
11010110101001010

user output
00101001010110101

Test 28

Group: 3

Verdict: ACCEPTED

input
4625

correct output
111011001100101001

user output
000100110011010110

Test 29

Group: 3

Verdict: ACCEPTED

input
4611

correct output
11010101010101100

user output
00101010101010011

Test 30

Group: 3

Verdict: ACCEPTED

input
4917

correct output
10110100101010110

user output
01001011010101001

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)