CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:Shrike
Submission time:2017-10-11 16:56:11 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.07 s1details
#4--1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.03 s1details
#7ACCEPTED0.07 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.06 s1details
#100.04 s1details
#11--2details
#12--2details
#13--2details
#14--2details
#15--2details
#16--2details
#17--2details
#18--2details
#19--2details
#20--2details
#21--3details
#22--3details
#23--3details
#24--3details
#25--3details
#26--3details
#27--3details
#28--3details
#29--3details
#30--3details
#31--4details
#320.06 s4details
#33--4details
#34--4details
#35--4details
#360.04 s4details
#370.05 s4details
#380.05 s4details
#390.07 s4details
#400.04 s4details

Compiler report

input/code.cpp: In function 'std::string answer(std::string, int)':
input/code.cpp:139:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < base.length(); i++) {
                                  ^
input/code.cpp: In function 'll nt(ll)':
input/code.cpp:106:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Code

#include <iostream>
#include <string>
#include <cmath>
#include <vector>

#define MAX_CHAR 256

using namespace std;

typedef long long ll;

ll
nt(ll n)
{
	switch(n) {

		case 0:
			return 0;
			break;
		case 1:
			return 1;
			break;
		case 2:
			return 3;
			break;
		case 3:
			return 6;
			break;
		case 4:
			return 11;
			break;
		case 5:
			return 19;
			break;
		case 6:
			return 32;
			break;
		case 7:
			return 53;
			break;
		case 8:
			return 87;
			break;
		case 9:
			return 142;
			break;
		case 10:
			return 231;
			break;
		case 11:
			return 375;
			break;
		case 12:
			return 608;
			break;
		case 13:
			return 985;
			break;
		case 14:
			return 1595;
			break;
		case 15:
			return 2582;
			break;
		case 16:
			return 4179;
			break;
		case 17:
			return 6763;
			break;
		case 18:
			return 10944;
			break;
		case 19:
			return 17709;
			break;
		case 20:
			return 28655;
			break;
		case 21:
			return 46366;
			break;
		case 22:
			return 75023;
			break;
		case 23:
			return 121391;
			break;
		case 24:
			return 196416;
			break;
		case 25:
			return 317809;
			break;
		case 26:
			return 514227;
			break;
		case 27:
			return 832038;
			break;
		case 28:
			return 1346267;
			break;
	}

}

char
flip(char c) {
	if (c == '1')
		return '0';
	return '1';
}

ll
pts(string str)
{
    vector<int> last(MAX_CHAR, -1);
 
    int n = str.length();
    int dp[n+1];
    dp[0] = 1;
    for (int i=1; i<=n; i++)
    {
        dp[i] = 2*dp[i-1];
        if (last[str[i-1]] != -1)
            dp[i] = dp[i] - dp[last[str[i-1]]];
        last[str[i-1]] = (i-1);
    }
 
    return dp[n]-1;
}

string
answer(string base, int pt)
{
	int lastflip;
	lastflip = 0;
	for (int i = 0; i < base.length(); i++) {
		if (pts(base) == pt)
			return base;
		string nbs = base;
		nbs.at(i) = '0';
		/* nbs.at(i) = flip(nbs.at(i)); */
		if (pts(nbs) == pt)
			return nbs;
		if (pts(nbs) < pts(base)) {
			nbs.at(lastflip) = '1';
			nbs.at(i) = '1';
			/* nbs.at(lastflip) = flip(nbs.at(lastflip)); */
			cout << nbs << endl;
			if (pts(nbs) == pt)
				return nbs;
			lastflip = i;
			i--;
		}
		base = nbs;
	}
	return "";
}

	
int
main(int argc, char **argv)
{
	int n, k;
	cin >> n;
	for (k = 0; k < 29; k++) {
		if (n < nt(k) || n == nt(k))
			break;
	}
	for (int i = k; k < 28; i++) {
		string str = string(i, '1');
		str = answer(str, n);
		if (str.length() > 0) {
			cout << str << endl;
			return 0;
		}
	}
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
1

user output
1

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
01

Test 4

Group: 1

Verdict:

input
4

correct output
1111

user output
(empty)

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
110

user output
011

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
101

user output
101
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
1011

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
1011
1001

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
(empty)

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
(empty)

Test 13

Group: 2

Verdict:

input
90

correct output
111001010

user output
(empty)

Test 14

Group: 2

Verdict:

input
25

correct output
110010

user output
(empty)

Test 15

Group: 2

Verdict:

input
82

correct output
111001101

user output
(empty)

Test 16

Group: 2

Verdict:

input
94

correct output
1100011110

user output
(empty)

Test 17

Group: 2

Verdict:

input
100

correct output
1111001001

user output
(empty)

Test 18

Group: 2

Verdict:

input
99

correct output
110010010

user output
(empty)

Test 19

Group: 2

Verdict:

input
98

correct output
110110010

user output
(empty)

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
(empty)

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
(empty)

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
(empty)

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
(empty)

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
(empty)

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
(empty)

Test 26

Group: 3

Verdict:

input
4697

correct output
11010101101010110

user output
(empty)

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
(empty)

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
(empty)

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
(empty)

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
(empty)

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)