CSES - Datatähti 2018 alku

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

Test results
test	verdict	time	group
#1	ACCEPTED	0.06 s	1	details
#2	ACCEPTED	0.06 s	1	details
#3	ACCEPTED	0.07 s	1	details
#4	TIME LIMIT EXCEEDED	--	1	details
#5	ACCEPTED	0.06 s	1	details
#6	ACCEPTED	0.03 s	1	details
#7	ACCEPTED	0.07 s	1	details
#8	ACCEPTED	0.05 s	1	details
#9	ACCEPTED	0.06 s	1	details
#10	WRONG ANSWER	0.04 s	1	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	TIME LIMIT EXCEEDED	--	2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	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	WRONG ANSWER	0.06 s	4	details
#33	TIME LIMIT EXCEEDED	--	4	details
#34	TIME LIMIT EXCEEDED	--	4	details
#35	TIME LIMIT EXCEEDED	--	4	details
#36	WRONG ANSWER	0.04 s	4	details
#37	WRONG ANSWER	0.05 s	4	details
#38	WRONG ANSWER	0.05 s	4	details
#39	WRONG ANSWER	0.07 s	4	details
#40	WRONG ANSWER	0.04 s	4	details

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` 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
`11` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`3` view save

correct output
`10` view save

user output
`01` view save

Test 4

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`4` view save

correct output
`1111` view save

user output
(empty)

Test 5

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`110` view save

user output
`011` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`101` view save

user output
`101 101` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`1110` view save

user output
`0111` 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 1011` view save

Test 10

Group: 1

Verdict: WRONG ANSWER

input
`10` view save

correct output
`1001` view save

user output
`1011 1001` view save

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`38` view save

correct output
`1101011` view save

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`13` view save

correct output
`11011` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`90` view save

correct output
`111001010` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`25` view save

correct output
`110010` view save

user output
(empty)

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`82` view save

correct output
`111001101` view save

user output
(empty)

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`94` view save

correct output
`1100011110` view save

user output
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100` view save

correct output
`1111001001` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`99` view save

correct output
`110010010` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`98` view save

correct output
`110110010` view save

user output
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`92` view save

correct output
`100110001` view save

user output
(empty)

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: WRONG ANSWER

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: 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 (Shrike)