CSES - Datatähti 2018 alku

CSES - Datatähti 2018 alku - Results

Submission details
Task:	Bittijono
Sender:	Tannhäuser
Submission time:	2017-10-07 23:23:19 +0300
Language:	C++
Status:	READY
Result:	49

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

Test results
test	verdict	time	group
#1	ACCEPTED	0.26 s	1	details
#2	ACCEPTED	0.19 s	1	details
#3	ACCEPTED	0.23 s	1	details
#4	ACCEPTED	0.22 s	1	details
#5	ACCEPTED	0.20 s	1	details
#6	ACCEPTED	0.21 s	1	details
#7	ACCEPTED	0.19 s	1	details
#8	ACCEPTED	0.15 s	1	details
#9	ACCEPTED	0.18 s	1	details
#10	ACCEPTED	0.22 s	1	details
#11	ACCEPTED	0.18 s	2	details
#12	ACCEPTED	0.21 s	2	details
#13	ACCEPTED	0.24 s	2	details
#14	ACCEPTED	0.19 s	2	details
#15	ACCEPTED	0.19 s	2	details
#16	ACCEPTED	0.16 s	2	details
#17	ACCEPTED	0.20 s	2	details
#18	ACCEPTED	0.18 s	2	details
#19	ACCEPTED	0.19 s	2	details
#20	ACCEPTED	0.19 s	2	details
#21	ACCEPTED	0.27 s	3	details
#22	ACCEPTED	0.22 s	3	details
#23	ACCEPTED	0.26 s	3	details
#24	ACCEPTED	0.24 s	3	details
#25	ACCEPTED	0.25 s	3	details
#26	ACCEPTED	0.22 s	3	details
#27	ACCEPTED	0.23 s	3	details
#28	ACCEPTED	0.21 s	3	details
#29	ACCEPTED	0.21 s	3	details
#30	ACCEPTED	0.23 s	3	details
#31	ACCEPTED	0.22 s	4	details
#32	WRONG ANSWER	0.22 s	4	details
#33	ACCEPTED	0.23 s	4	details
#34	WRONG ANSWER	0.23 s	4	details
#35	ACCEPTED	0.23 s	4	details
#36	ACCEPTED	0.25 s	4	details
#37	WRONG ANSWER	0.21 s	4	details
#38	ACCEPTED	0.27 s	4	details
#39	WRONG ANSWER	0.22 s	4	details
#40	WRONG ANSWER	0.24 s	4	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:101: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 {
	ll 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 (ll y = 0; y < 3; y++) {
		for (ll 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 (ll y = 0; y < 3; y++) {
		for (ll x = 0; x < 3; x++) {
			c.v[y][x] = 0;
			for (ll 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<ll> su[4181];

vector<ll> su[4181][2584];

ll l[(1<<16)];

ll test (const string s) {
	ll l = s.length();
	ll dp[l];
	ll l1 = -1;
	ll l0 = -1;
	for (ll 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 () {
	ll k;
	cin>>k;
	k++;
	v[0] = I;
	inv[0] = I;
	for (ll 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 (ll i = 0; i < (1<<16); i++) {
		X a = v[i];
		su[a.v[0][0] + a.v[0][2]][a.v[1][0] + a.v[1][2]].push_back(i);
	}
	string sh = "1111111111111111111111111111111111111111111111";
	for (ll i = 0; i < (1<<16); i++) {
		if (l[i] >= sh.length()) break;
		X ai = inv[i];
		if (ai.v[0][1] == 0) {
			ll q = (ai.v[0][0] * k + ai.v[0][2]);
			ll q2 = (ai.v[1][0] * k + ai.v[1][2]);
			if (q >= 0 && q <= 4180 && q2 <= 2583 && q2 >= 0) for (ll j : su[q][q2]) {
				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) {
					ll c = 0;
					string s = "";
					ll ic = i;
					ll jc = j;
					for (ll k = l[i]; k --> 0;) {
						if (i % 2) c = 1 - c;
						i = (i - 1) / 2;
						s += c ? '1' : '0'; 
					}
					string t;
					for (ll 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 {
			ll q = (ai.v[0][0] * k + ai.v[0][2]);
			ll q2 = (ai.v[1][0] * k + ai.v[1][2]);
			ll 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 && q2 - ai.v[1][1] * c >= 0 && q2 - ai.v[1][1] * c <= 2583) for (ll j : su[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) {
						ll c = 0;
						//cout<<i<<" "<<j<<" "<<c<<" "<<ai.v[0][1]<<endl;
						string s = "";
						ll ic = i;
						ll jc = j;
						for (ll k = l[i]; k --> 0;) {
							if (i % 2) c = 1 - c;
							i = (i - 1) / 2;
							s += c ? '1' : '0'; 
						}
						string t;
						for (ll 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` 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
`0000` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`110` view save

user output
`100` 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
`1000` 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
`1011` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`1001` view save

user output
`1001` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`38` view save

correct output
`1101011` view save

user output
`0010100` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`13` view save

correct output
`11011` view save

user output
`00100` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`90` view save

correct output
`111001010` view save

user output
`100100010` view save

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

input
`82` view save

correct output
`111001101` view save

user output
`100010011` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`94` view save

correct output
`1100011110` view save

user output
`1000011100` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`100` view save

correct output
`1111001001` view save

user output
`1001001111` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`99` view save

correct output
`110010010` view save

user output
`100011010` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`98` view save

correct output
`110110010` view save

user output
`100111010` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`92` view save

correct output
`100110001` view save

user output
`100011001` view save

Test 21

Group: 3

Verdict: ACCEPTED

input
`1666` view save

correct output
`101101100100101` view save

user output
`100100010101010` view save

Test 22

Group: 3

Verdict: ACCEPTED

input
`897` view save

correct output
`11101001101010` view save

user output
`10100010110100` view save

Test 23

Group: 3

Verdict: ACCEPTED

input
`4466` view save

correct output
`111101010110100101` view save

user output
`101001001110001011` 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
`10101101101101010` 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
`101011100110101000` 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
`10110100101010110` view save

Test 31

Group: 4

Verdict: ACCEPTED

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
`0100101001001010101001001` view save

Test 32

Group: 4

Verdict: WRONG ANSWER

input
`864856` view save

correct output
`10111010110110100100101010010` view save

user output
`111111111111111111111111111111...` view save

Test 33

Group: 4

Verdict: ACCEPTED

input
`112146` view save

correct output
`1101110101011001100100110` view save

user output
`1001001001001100011010100` view save

Test 34

Group: 4

Verdict: WRONG ANSWER

input
`741124` view save

correct output
`1011010011010101100101011010` view save

user output
`101100101001101001100000101011` view save

Test 35

Group: 4

Verdict: ACCEPTED

input
`511902` view save

correct output
`1011010100011010100101001110` view save

user output
`1010100100101010100001101001` view save

Test 36

Group: 4

Verdict: ACCEPTED

input
`920019` view save

correct output
`11100100101101010101001101010` view save

user output
`10101001101010101001011011000` view save

Test 37

Group: 4

Verdict: WRONG ANSWER

input
`933943` view save

correct output
`10101011010100100110100111001` view save

user output
`110110111011011001001100110101` view save

Test 38

Group: 4

Verdict: ACCEPTED

input
`973410` view save

correct output
`1011010101011010101010101001` view save

user output
`1011010101011010101010101001` view save

Test 39

Group: 4

Verdict: WRONG ANSWER

input
`954943` view save

correct output
`10110110010011010100100110101` view save

user output
`110010101010011010111001100111` view save

Test 40

Group: 4

Verdict: WRONG ANSWER

input
`911674` view save

correct output
`1010110010110101010101010110` view save

user output
`010101010101010000100010101000` 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 (Tannhäuser)