CSES - Datatähti 2018 alku

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
group	verdict	score
#1	ACCEPTED	7
#2	ACCEPTED	15
#3	TIME LIMIT EXCEEDED	0
#4	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.08 s	1	details
#2	ACCEPTED	0.07 s	1	details
#3	ACCEPTED	0.06 s	1	details
#4	ACCEPTED	0.09 s	1	details
#5	ACCEPTED	0.09 s	1	details
#6	ACCEPTED	0.10 s	1	details
#7	ACCEPTED	0.10 s	1	details
#8	ACCEPTED	0.08 s	1	details
#9	ACCEPTED	0.07 s	1	details
#10	ACCEPTED	0.07 s	1	details
#11	ACCEPTED	0.13 s	2	details
#12	ACCEPTED	0.06 s	2	details
#13	ACCEPTED	0.15 s	2	details
#14	ACCEPTED	0.11 s	2	details
#15	ACCEPTED	0.16 s	2	details
#16	ACCEPTED	0.26 s	2	details
#17	ACCEPTED	0.23 s	2	details
#18	ACCEPTED	0.18 s	2	details
#19	ACCEPTED	0.18 s	2	details
#20	ACCEPTED	0.17 s	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	TIME LIMIT EXCEEDED	--	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: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` 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: 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: TIME LIMIT EXCEEDED

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
(empty)

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