CSES - Datatähti 2018 alku

CSES - Datatähti 2018 alku - Results

Submission details
Task:	Bittijono
Sender:	Tannhäuser
Submission time:	2017-10-08 00:10:24 +0300
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0
#3	RUNTIME ERROR	0
#4	RUNTIME ERROR	0

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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:111:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (l[i] >= sh.length()) break;
                          ^
input/code.cpp:117:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if (l[i] + l[j] >= sh.length()) break;
                                   ^
input/code.cpp:151:36: 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<ll, ll>
#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<<19)];
X inv[(1<<19)];
//vector<ll> su[4181];

vector<ll> su[22001][11000 / 10];

ll l[(1<<19)];

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 () {
	//for (ll z = 1000000; z >= 0; z--) {
		ll k;
		//cout<<k<<" -> ";
		cin>>k;
		k++;
		v[0] = I;
		inv[0] = I;
		for (ll i = 1; i < (1<<18); 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;
		}
		ll mx = 0;
		ll mx2 = 0;
		ll mx3 = 0;
		for (ll i = 0; i < (1<<18); i++) {
			X a = v[i];
			mx = max(mx, a.v[0][0] + a.v[0][2]);
			mx2 = max(mx2, a.v[1][0] + a.v[1][2]);

			su[a.v[0][0] + a.v[0][2]][(a.v[1][0] + a.v[1][2]) / 10].push_back(i);
			mx3 = max(mx3, (ll)su[a.v[0][0] + a.v[0][2]][(a.v[1][0] + a.v[1][2]) / 10].size());
		}
		//cout<<mx<<" "<<mx2<<" "<<mx3<<endl;
		string sh = "1111111111111111111111111111111111111111111111";
		for (ll i = 0; i < (1<<18); 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]) / 10;
				if (q >= 0 && q <= 22000 && q2 < 6800 / 10 && 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 <= 22000) {
					// 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) / 10 >= 0 && (q2 - ai.v[1][1] * c) / 10 < 6800 / 10) for (ll j : su[q - ai.v[0][1] * c][(q2 - ai.v[1][1] * c) / 10]) {
						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: RUNTIME ERROR

input
`1` view save

correct output
`1` view save

user output
(empty)

Test 2

Group: 1

Verdict: RUNTIME ERROR

input
`2` view save

correct output
`11` view save

user output
(empty)

Test 3

Group: 1

Verdict: RUNTIME ERROR

input
`3` view save

correct output
`10` view save

user output
(empty)

Test 4

Group: 1

Verdict: RUNTIME ERROR

input
`4` view save

correct output
`1111` view save

user output
(empty)

Test 5

Group: 1

Verdict: RUNTIME ERROR

input
`5` view save

correct output
`110` view save

user output
(empty)

Test 6

Group: 1

Verdict: RUNTIME ERROR

input
`6` view save

correct output
`101` view save

user output
(empty)

Test 7

Group: 1

Verdict: RUNTIME ERROR

input
`7` view save

correct output
`1110` view save

user output
(empty)

Test 8

Group: 1

Verdict: RUNTIME ERROR

input
`8` view save

correct output
`1100` view save

user output
(empty)

Test 9

Group: 1

Verdict: RUNTIME ERROR

input
`9` view save

correct output
`1101` view save

user output
(empty)

Test 10

Group: 1

Verdict: RUNTIME ERROR

input
`10` view save

correct output
`1001` view save

user output
(empty)

Test 11

Group: 2

Verdict: RUNTIME ERROR

input
`38` view save

correct output
`1101011` view save

user output
(empty)

Test 12

Group: 2

Verdict: RUNTIME ERROR

input
`13` view save

correct output
`11011` view save

user output
(empty)

Test 13

Group: 2

Verdict: RUNTIME ERROR

input
`90` view save

correct output
`111001010` view save

user output
(empty)

Test 14

Group: 2

Verdict: RUNTIME ERROR

input
`25` view save

correct output
`110010` view save

user output
(empty)

Test 15

Group: 2

Verdict: RUNTIME ERROR

input
`82` view save

correct output
`111001101` view save

user output
(empty)

Test 16

Group: 2

Verdict: RUNTIME ERROR

input
`94` view save

correct output
`1100011110` view save

user output
(empty)

Test 17

Group: 2

Verdict: RUNTIME ERROR

input
`100` view save

correct output
`1111001001` view save

user output
(empty)

Test 18

Group: 2

Verdict: RUNTIME ERROR

input
`99` view save

correct output
`110010010` view save

user output
(empty)

Test 19

Group: 2

Verdict: RUNTIME ERROR

input
`98` view save

correct output
`110110010` view save

user output
(empty)

Test 20

Group: 2

Verdict: RUNTIME ERROR

input
`92` view save

correct output
`100110001` view save

user output
(empty)

Test 21

Group: 3

Verdict: RUNTIME ERROR

input
`1666` view save

correct output
`101101100100101` view save

user output
(empty)

Test 22

Group: 3

Verdict: RUNTIME ERROR

input
`897` view save

correct output
`11101001101010` view save

user output
(empty)

Test 23

Group: 3

Verdict: RUNTIME ERROR

input
`4466` view save

correct output
`111101010110100101` view save

user output
(empty)

Test 24

Group: 3

Verdict: RUNTIME ERROR

input
`4240` view save

correct output
`11011001011010101` view save

user output
(empty)

Test 25

Group: 3

Verdict: RUNTIME ERROR

input
`3089` view save

correct output
`1011001010100101` view save

user output
(empty)

Test 26

Group: 3

Verdict: RUNTIME ERROR

input
`4697` view save

correct output
`11010101101010110` view save

user output
(empty)

Test 27

Group: 3

Verdict: RUNTIME ERROR

input
`4608` view save

correct output
`11010110101001010` view save

user output
(empty)

Test 28

Group: 3

Verdict: RUNTIME ERROR

input
`4625` view save

correct output
`111011001100101001` view save

user output
(empty)

Test 29

Group: 3

Verdict: RUNTIME ERROR

input
`4611` view save

correct output
`11010101010101100` view save

user output
(empty)

Test 30

Group: 3

Verdict: RUNTIME ERROR

input
`4917` view save

correct output
`10110100101010110` view save

user output
(empty)

Test 31

Group: 4

Verdict: RUNTIME ERROR

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
(empty)

Test 32

Group: 4

Verdict: RUNTIME ERROR

input
`864856` view save

correct output
`10111010110110100100101010010` view save

user output
(empty)

Test 33

Group: 4

Verdict: RUNTIME ERROR

input
`112146` view save

correct output
`1101110101011001100100110` view save

user output
(empty)

Test 34

Group: 4

Verdict: RUNTIME ERROR

input
`741124` view save

correct output
`1011010011010101100101011010` view save

user output
(empty)

Test 35

Group: 4

Verdict: RUNTIME ERROR

input
`511902` view save

correct output
`1011010100011010100101001110` view save

user output
(empty)

Test 36

Group: 4

Verdict: RUNTIME ERROR

input
`920019` view save

correct output
`11100100101101010101001101010` view save

user output
(empty)

Test 37

Group: 4

Verdict: RUNTIME ERROR

input
`933943` view save

correct output
`10101011010100100110100111001` view save

user output
(empty)

Test 38

Group: 4

Verdict: RUNTIME ERROR

input
`973410` view save

correct output
`1011010101011010101010101001` view save

user output
(empty)

Test 39

Group: 4

Verdict: RUNTIME ERROR

input
`954943` view save

correct output
`10110110010011010100100110101` view save

user output
(empty)

Test 40

Group: 4

Verdict: RUNTIME ERROR

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