CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:Tannhäuser
Submission time:2017-10-07 23:04:52 +0300
Language:C++
Status:READY
Result:22
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.08 s1details
#2ACCEPTED0.07 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.09 s1details
#5ACCEPTED0.09 s1details
#6ACCEPTED0.10 s1details
#7ACCEPTED0.10 s1details
#8ACCEPTED0.08 s1details
#9ACCEPTED0.07 s1details
#10ACCEPTED0.07 s1details
#11ACCEPTED0.13 s2details
#12ACCEPTED0.06 s2details
#13ACCEPTED0.15 s2details
#14ACCEPTED0.11 s2details
#15ACCEPTED0.16 s2details
#16ACCEPTED0.26 s2details
#17ACCEPTED0.23 s2details
#18ACCEPTED0.18 s2details
#19ACCEPTED0.18 s2details
#20ACCEPTED0.17 s2details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#27--3details
#28--3details
#29--3details
#30--3details
#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 main()':
input/code.cpp:102:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (l[i] >= sh.length()) break;
                         ^
input/code.cpp:107:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (l[i] + l[j] >= sh.length()) break;
                                  ^
input/code.cpp:141:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if (l[i] + l[j] >= sh.length()) break;
                                   ^

Code

#include <bits/stdc++.h>

#define N (1<<19)
#define ll long long
#define ld long double
#define M 1000000007
#define INF 0x5ADFACE5
#define LINF 0x51DEEFFEC7C0DECALL
#define pii pair<int, int>
#define pll pair<long long, long long>
#define F first
#define S second

using namespace std;

struct X {
	int v[3][3];
};

X I = {{{1, 0, 0}, {0, 1, 0}, {0, 0, 1}}};
X A = {{{1, 1, 1}, {1, 0, 0}, {0, 0, 1}}};
X B = {{{2, -1, 0}, {1, 0, 0}, {0, 0, 1}}};
X AI = {{{0, 1, 0}, {1, -1, -1}, {0, 0, 1}}};
X BI = {{{0, 1, 0}, {-1, 2, 0}, {0, 0, 1}}};



inline bool eq (const X a, const X b) {
	for (int y = 0; y < 3; y++) {
		for (int x = 0; x < 3; x++) {
			if (a.v[y][x] != b.v[y][x]) return false;
		}
	}
	return true;
}

X mul (const X a, const X b) {
	if (eq(b, I)) return a;
	if (eq(a, I)) return b;
	X c;
	for (int y = 0; y < 3; y++) {
		for (int x = 0; x < 3; x++) {
			c.v[y][x] = 0;
			for (int z = 0; z < 3; z++) {
				c.v[y][x] += a.v[y][z] * b.v[z][x];
			}
		}
	}
	return c;
}

X v[(1<<16)];
X inv[(1<<16)];
//vector<int> su[4181];

unordered_map<int, vector<int>> su;

int l[(1<<16)];

int test (const string s) {
	int l = s.length();
	int dp[l];
	int l1 = -1;
	int l0 = -1;
	for (int j = 0; j < l; j++) {
		dp[j] = 0;
		if (s[j] == '1') {
			if (j) dp[j] = 2 * dp[j - 1];
			else dp[j] = 2;
			if (l1 != -1) dp[j] -= !l1 ? 1 : dp[l1 - 1];
			l1 = j;
		} else {
			if (j) dp[j] = 2 * dp[j - 1];
			else dp[j] = 2;
			if (l0 != -1) dp[j] -= !l0 ? 1 : dp[l0 - 1];
			l0 = j;
		}
	}
	return dp[l - 1];
}

int main () {
	int k;
	cin>>k;
	k++;
	v[0] = I;
	inv[0] = I;
	for (int i = 1; i < (1<<16); i++) {
		if (i & 1) v[i] = mul(v[(i - 1) / 2], A);
		else v[i] = mul(v[(i - 1) / 2], B);
		if (i & 1) inv[i] = mul(AI, inv[(i - 1) / 2]);
		else inv[i] = mul(BI, inv[(i - 1) / 2]);
		l[i] = l[(i - 1) / 2] + 1;
	}
	for (int i = 0; i < (1<<16); i++) {
		X a = v[i];

		su[4180 * (a.v[0][0] + a.v[0][2]) + a.v[1][0] + a.v[1][2]].push_back(i);
	}
	string sh = "1111111111111111111111111111111111111111111111";
	for (int i = 0; i < (1<<16); i++) {
		if (l[i] >= sh.length()) break;
		X ai = inv[i];
		if (ai.v[0][1] == 0) {
			int q = (ai.v[0][0] * k + ai.v[0][2]);
			if (q >= 0 && q <= 4180) for (int j : su[q]) {
				if (l[i] + l[j] >= sh.length()) break;
				X p = mul(v[i], v[j]);
				if (p.v[0][0] + p.v[0][2] == k) {
					int c = 0;
					string s = "";
					int ic = i;
					int jc = j;
					for (int k = l[i]; k --> 0;) {
						if (i % 2) c = 1 - c;
						i = (i - 1) / 2;
						s += c ? '1' : '0'; 
					}
					string t;
					for (int k = l[j]; k --> 0;) {
						if (j % 2) c = 1 - c;
						j = (j - 1) / 2;
						t += c ? '1' : '0'; 
					}
					reverse(t.begin(), t.end());
					s += t;
					if (test(s) == k) {
						if (s.length() < sh.length()) sh = s;
					}
					i = ic;
					j = jc;
				}
			}
		} else {
			int q = (ai.v[0][0] * k + ai.v[0][2]);
			int q2 = (ai.v[1][0] * k + ai.v[1][2]);
			int c = q / ai.v[0][1];
			while (q - ai.v[0][1] * c <= 4180) {
				// 4180 * (a.v[0][0] + a.v[0][2]) + a.v[1][0] + a.v[1][2]
				if (q - ai.v[0][1] * c >= 0) for (int j : su[4180 * (q - ai.v[0][1] * c) + q2 - ai.v[1][1] * c]) {
					if (l[i] + l[j] >= sh.length()) break;
					X p = mul(v[i], v[j]);
					if (p.v[0][0] + p.v[0][2] == k) {
						int c = 0;
						//cout<<i<<" "<<j<<" "<<c<<" "<<ai.v[0][1]<<endl;
						string s = "";
						int ic = i;
						int jc = j;
						for (int k = l[i]; k --> 0;) {
							if (i % 2) c = 1 - c;
							i = (i - 1) / 2;
							s += c ? '1' : '0'; 
						}
						string t;
						for (int k = l[j]; k --> 0;) {
							if (j % 2) c = 1 - c;
							j = (j - 1) / 2;
							t += c ? '1' : '0'; 
						}
						reverse(t.begin(), t.end());
						s += t;
						if (test(s) == k) {
							if (s.length() < sh.length()) sh = s;
						}
						i = ic;
						j = jc;
					}
				}

				if (ai.v[0][1] < 0) c++;
				else c--;
			}
		}
	}
	cout<<sh<<endl;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
1

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
10

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
100

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
101

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
1000

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
1011

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
1001

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
100100010

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
101100

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
1000011100

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
1001001111

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
100011010

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
100111010

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
100011001

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
(empty)

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
(empty)

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
(empty)

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
(empty)

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
(empty)

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
(empty)

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
(empty)

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
(empty)

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
(empty)

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
(empty)

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)