CSES - Datatähti 2018 alku

CSES - Datatähti 2018 alku - Results

Submission details
Task:	Bittijono
Sender:	Tannhäuser
Submission time:	2017-10-04 19:03:17 +0300
Language:	C++
Status:	READY
Result:	7

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

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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:31:10: warning: unused variable 'y' [-Wunused-variable]
      int y = i;
          ^

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;

pii b[500002][32];
pii f[500002][32];
int foo[500002][32];

int main () {
	int n;
	cin>>n;
	b[1][0] = {0, 0};
	f[1][0] = {-1, 0};
	int mx = 1;
	for (int i = 1; i < 50; i++) {
		for (int j = i - 1; j >= 0; j--) {
			for (int k = mx; k >= 1; k--) {
				if (f[k][j] != make_pair(0, 0) || b[k][j] != make_pair(0, 0)) {
					//cout<<k<<" "<<j<<endl;
					int y = i;
					int x = j;
					int ys = b[k][j].S;
					int xs = b[k][j].F;
					{	
						int s = 2 * k - ys;
						if (s <= n + 1 && b[s][x] == make_pair(0, 0)) {
							b[s][x] = {xs, k};
							f[s][x] = {k, j};
							foo[s][x] = foo[k][j];
							//cout<<"set "<<s<<" "<<x<<" "<<foo[s][x]<<endl;
							mx = max(mx, s);
							if (s == n + 1) {
								int y = n + 1;
								int e = b[y][x].F;
								int ch = 0;
								cout<<foo[y][x];
								while (y != 1) {
									pii p = f[y][x];
									x = p.S;
									y = p.F;
									if (b[y][x].F != e) {
										ch = 1 - ch;
									}
									if (y != 1) cout<<foo[y][x];
									e = b[y][x].F;
								}
								cout<<endl;
								return 0;
							}
							if (s >= 99995) return 0;
						}
					} 
					{	
						int s = 2 * k - xs;
						if (s <= n + 1 && b[s][x] == make_pair(0, 0)) {
							b[s][i - 1] = {ys, k};
							f[s][i - 1] = {k, j};
							foo[s][i - 1] = 1 - foo[k][j];
							//cout<<"set "<<s<<" "<<i - 1<<" "<<foo[s][i - 1]<<endl;
							mx = max(mx, s);
							if (s == n + 1) {
								int x = i - 1;
								int y = n + 1;
								int e = b[y][x].F;
								int ch = 0;
								cout<<foo[y][x];
								while (y != 1) {
									pii p = f[y][x];
									x = p.S;
									y = p.F;
									if (b[y][x].F != e) {
										ch = 1 - ch;
									}
									if (y != 1) cout<<foo[y][x];
									e = b[y][x].F;
								}
								cout<<endl;
								return 0;
							}
						}
					}
				}
			}
		}
	}
}

/*string sol2 (const int n) {
	for (int l = 1;; l++) {
		bool b = 0;
		for (int i = 0; i < (1<<l); i++) {
			int dp[l];
			int l1 = -1;
			int l0 = -1;
			for (int j = 0; j < l; j++) {
				dp[j] = 0;
				if (i & (1<<j)) {
					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;
				}
			}
			string s;
			for (int j = 0; j < l; j++) {
				if (i & (1<<j)) s += "1";
				else s += "0";
			}
		
			if (dp[l - 1] - 1 == n) {
				string s;
				for (int j = 0; j < l; j++) {
					if (i & (1<<j)) s += "1";
					else s += "0";
				}
				cout<<s<<" ";
				b = 1;
			}
		}
		if (b) return "";
	}
}

string guess (int n) {
	if (n == 1) return "0";
	if (n == 2) return "00";
	int ml = 1;
	int mi = 1;
	{
		int x = 1;
		int y = 2;
		while (ml + y < n) {
			mi++;
			ml += y;
			int z = x + y;
			x = y;
			y = z;
		}
	}
	cout<<"["<<mi + 1<<", "<<mi + 3<<"]"<<endl;
	while (true) {
		for (int l = max(1, mi + 1); l <= min(29, mi + 3); l++) {
			for (int t = 0; t < 3000000; t++) {
				int i = rand() % (1<<l);
				int dp[l];
				int l1 = -1;
				int l0 = -1;
				for (int j = 0; j < l; j++) {
					dp[j] = 0;
					if (i & (1<<j)) {
						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;
					}
				}

				if (dp[l - 1] - 1 == n) {
					string s;
					for (int j = 0; j < l; j++) {
						if (i & (1<<j)) s += "1";
						else s += "0";
					}
					return s;
				}
				
			}
		}
	}
}

int main () {
	srand(time(0));
	int n;
	cin>>n;
	int m;
	cin>>m;
	while (n <= m) {
		cout<<n<<" -> ";
		cout<<sol2(n)<<endl;
		//cout<<n<<" => "<<guess(n)<<endl;
		n++;
	}
}*/

/**
15 -> 01100 00110 11001 10011 
16 -> 10100 11010 00101 01011 
17 -> 10010 10110 01001 01101 
18 -> 011110 100001 
19 -> 01010 10101 
20 -> 011000 000110 111001 100111 
21 -> 101000 011100 111010 001110 110001 000101 100011 010111 
22 -> 001100 110011 
23 -> 110100 100010 101110 010001 011101 001011 
24 -> 100100 110110 001001 011011 
25 -> 101100 110010 001101 010011 
*/

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`1` view save

correct output
`1` view save

user output
`0` 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
`110` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`101` view save

user output
`010` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`1110` view save

user output
`1110` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`8` view save

correct output
`1100` view save

user output
`1100` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`9` view save

correct output
`1101` view save

user output
`0010` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`1001` view save

user output
`0110` view save

Test 11

Group: 2

Verdict: WRONG ANSWER

input
`38` view save

correct output
`1101011` view save

user output
`01111111110` view save

Test 12

Group: 2

Verdict: WRONG ANSWER

input
`13` view save

correct output
`11011` view save

user output
`1111110` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`90` view save

correct output
`111001010` view save

user output
`111001010` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`25` view save

correct output
`110010` view save

user output
`110010` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`82` view save

correct output
`111001101` view save

user output
`000110010` 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: WRONG ANSWER

input
`100` view save

correct output
`1111001001` view save

user output
`01000000000010` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`99` view save

correct output
`110010010` view save

user output
`110010010` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`98` view save

correct output
`110110010` view save

user output
`110110010` view save

Test 20

Group: 2

Verdict: WRONG ANSWER

input
`92` view save

correct output
`100110001` view save

user output
`1011111010` view save

Test 21

Group: 3

Verdict: ACCEPTED

input
`1666` view save

correct output
`101101100100101` view save

user output
`010110110010010` view save

Test 22

Group: 3

Verdict: WRONG ANSWER

input
`897` view save

correct output
`11101001101010` view save

user output
`001000010010010` view save

Test 23

Group: 3

Verdict: WRONG ANSWER

input
`4466` view save

correct output
`111101010110100101` view save

user output
`0111110000110101010` view save

Test 24

Group: 3

Verdict: WRONG ANSWER

input
`4240` view save

correct output
`11011001011010101` view save

user output
`10111111111110011010010` view save

Test 25

Group: 3

Verdict: WRONG ANSWER

input
`3089` view save

correct output
`1011001010100101` view save

user output
`0100000001101010010` view save

Test 26

Group: 3

Verdict: WRONG ANSWER

input
`4697` view save

correct output
`11010101101010110` view save

user output
`101001100001010010` view save

Test 27

Group: 3

Verdict: WRONG ANSWER

input
`4608` view save

correct output
`11010110101001010` view save

user output
`0100010000110111010` view save

Test 28

Group: 3

Verdict: WRONG ANSWER

input
`4625` view save

correct output
`111011001100101001` view save

user output
`01000000000001101010010` view save

Test 29

Group: 3

Verdict: WRONG ANSWER

input
`4611` view save

correct output
`11010101010101100` view save

user output
`101000111100101010` view save

Test 30

Group: 3

Verdict: WRONG ANSWER

input
`4917` view save

correct output
`10110100101010110` view save

user output
`110110110001010010` view save

Test 31

Group: 4

Verdict: WRONG ANSWER

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
(empty)

Test 32

Group: 4

Verdict: WRONG ANSWER

input
`864856` view save

correct output
`10111010110110100100101010010` view save

user output
(empty)

Test 33

Group: 4

Verdict: WRONG ANSWER

input
`112146` view save

correct output
`1101110101011001100100110` view save

user output
(empty)

Test 34

Group: 4

Verdict: WRONG ANSWER

input
`741124` view save

correct output
`1011010011010101100101011010` view save

user output
(empty)

Test 35

Group: 4

Verdict: WRONG ANSWER

input
`511902` view save

correct output
`1011010100011010100101001110` view save

user output
(empty)

Test 36

Group: 4

Verdict: WRONG ANSWER

input
`920019` view save

correct output
`11100100101101010101001101010` view save

user output
(empty)

Test 37

Group: 4

Verdict: WRONG ANSWER

input
`933943` view save

correct output
`10101011010100100110100111001` view save

user output
(empty)

Test 38

Group: 4

Verdict: WRONG ANSWER

input
`973410` view save

correct output
`1011010101011010101010101001` view save

user output
(empty)

Test 39

Group: 4

Verdict: WRONG ANSWER

input
`954943` view save

correct output
`10110110010011010100100110101` view save

user output
(empty)

Test 40

Group: 4

Verdict: WRONG ANSWER

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)