CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:Tannhäuser
Submission time:2017-10-04 19:29:31 +0300
Language:C++
Status:READY
Result:7
Feedback
groupverdictscore
#1ACCEPTED7
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.09 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.07 s1details
#4ACCEPTED0.07 s1details
#5ACCEPTED0.07 s1details
#6ACCEPTED0.06 s1details
#7ACCEPTED0.06 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.06 s1details
#10ACCEPTED0.06 s1details
#110.07 s2details
#120.06 s2details
#13ACCEPTED0.06 s2details
#14ACCEPTED0.08 s2details
#15ACCEPTED0.08 s2details
#16ACCEPTED0.06 s2details
#170.07 s2details
#18ACCEPTED0.09 s2details
#19ACCEPTED0.07 s2details
#200.05 s2details
#21ACCEPTED0.07 s3details
#220.06 s3details
#230.07 s3details
#240.08 s3details
#250.06 s3details
#260.08 s3details
#270.06 s3details
#280.09 s3details
#290.07 s3details
#300.10 s3details
#310.25 s4details
#320.23 s4details
#330.23 s4details
#340.22 s4details
#350.25 s4details
#360.22 s4details
#370.26 s4details
#380.25 s4details
#390.23 s4details
#400.24 s4details

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;

/*
823
*/

pii b[50002][50];
pii f[50002][50];
int foo[50002][50];

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 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;
							}
						}
					} 
					{	
						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

correct output
1

user output
0

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
110

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
010

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
1110

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
1100

user output
1100

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
0010

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
0110

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
01111111110

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
1111110

Test 13

Group: 2

Verdict: ACCEPTED

input
90

correct output
111001010

user output
111001010

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
110010

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
000110010

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
1000011100

Test 17

Group: 2

Verdict:

input
100

correct output
1111001001

user output
01000000000010

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
110010010

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
110110010

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
1011111010

Test 21

Group: 3

Verdict: ACCEPTED

input
1666

correct output
101101100100101

user output
010110110010010

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
001000010010010

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
0111110000110101010

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
10111111111110011010010

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
0100000001101010010

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
101001100001010010

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
0100010000110111010

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
01000000000001101010010

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
101000111100101010

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
110110110001010010

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)