CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:Tannhäuser
Submission time:2017-10-02 09:26:36 +0300
Language:C++
Status:READY
Result:42
Feedback
groupverdictscore
#10
#2ACCEPTED15
#3ACCEPTED27
#40
Test results
testverdicttimegroup
#1--1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.21 s1details
#5ACCEPTED0.04 s1details
#6ACCEPTED0.04 s1details
#7ACCEPTED0.06 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.03 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.04 s2details
#12ACCEPTED0.04 s2details
#13ACCEPTED0.04 s2details
#14ACCEPTED0.04 s2details
#15ACCEPTED0.33 s2details
#16ACCEPTED0.35 s2details
#17ACCEPTED0.40 s2details
#18ACCEPTED0.05 s2details
#19ACCEPTED0.05 s2details
#20ACCEPTED0.04 s2details
#21ACCEPTED0.04 s3details
#22ACCEPTED0.43 s3details
#23ACCEPTED0.58 s3details
#24ACCEPTED0.06 s3details
#25ACCEPTED0.05 s3details
#26ACCEPTED0.05 s3details
#27ACCEPTED0.05 s3details
#28ACCEPTED0.51 s3details
#29ACCEPTED0.04 s3details
#30ACCEPTED0.04 s3details
#31--4details
#32--4details
#33--4details
#34--4details
#35--4details
#36--4details
#37--4details
#38--4details
#39--4details
#40--4details

Compiler report

input/code.cpp: In function 'std::string guess(int)':
input/code.cpp:62:6: warning: unused variable 'a' [-Wunused-variable]
  int a = (int)(1.5 * log((float)n) / log(2));
      ^

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;

/*
läbäl
*/

string sol2 (const int n) {
	for (int l = 1; l < 6; l++) {
		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";
			}
			cout<<s<<" -> "<<(dp[l - 1] - 1)<<endl;

			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;
			}
			
		}
	}
	exit(0);
}

string guess (int n) {
	int a = (int)(1.5 * log((float)n) / log(2));
	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;
		}
	}
	while (true) {
		for (int l = max(1, mi + 1); l <= min(29, mi + 2); l++) {
			for (int t = 0; t < 4000000; 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;
	cout<<guess(n)<<endl;
}

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
(empty)

Test 2

Group: 1

Verdict: ACCEPTED

input
2

correct output
11

user output
11

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
1111

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
110

user output
001

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
101

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
1110

user output
0111

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
1100

user output
0011

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
1101

user output
1011

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
1001

Test 11

Group: 2

Verdict: ACCEPTED

input
38

correct output
1101011

user output
1101011

Test 12

Group: 2

Verdict: ACCEPTED

input
13

correct output
11011

user output
00100

Test 13

Group: 2

Verdict: ACCEPTED

input
90

correct output
111001010

user output
101110110

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
010011

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
100010011

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
1100011110

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
1100011000

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
101001110

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
011000101

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
011100110

Test 21

Group: 3

Verdict: ACCEPTED

input
1666

correct output
101101100100101

user output
101101100100101

Test 22

Group: 3

Verdict: ACCEPTED

input
897

correct output
11101001101010

user output
01001100100100

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
110111101010110101

Test 24

Group: 3

Verdict: ACCEPTED

input
4240

correct output
11011001011010101

user output
00100110100101010

Test 25

Group: 3

Verdict: ACCEPTED

input
3089

correct output
1011001010100101

user output
1010010101001101

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
01101010110101011

Test 27

Group: 3

Verdict: ACCEPTED

input
4608

correct output
11010110101001010

user output
00101001010110101

Test 28

Group: 3

Verdict: ACCEPTED

input
4625

correct output
111011001100101001

user output
110010010110100011

Test 29

Group: 3

Verdict: ACCEPTED

input
4611

correct output
11010101010101100

user output
00101011010110101

Test 30

Group: 3

Verdict: ACCEPTED

input
4917

correct output
10110100101010110

user output
10110100101010110

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)