CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:ArktinenKarpalo
Submission time:2017-10-12 13:55:22 +0300
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED15
#3ACCEPTED27
#4ACCEPTED51
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.07 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.05 s2details
#12ACCEPTED0.06 s2details
#13ACCEPTED0.05 s2details
#14ACCEPTED0.05 s2details
#15ACCEPTED0.06 s2details
#16ACCEPTED0.05 s2details
#17ACCEPTED0.05 s2details
#18ACCEPTED0.06 s2details
#19ACCEPTED0.06 s2details
#20ACCEPTED0.05 s2details
#21ACCEPTED0.05 s3details
#22ACCEPTED0.06 s3details
#23ACCEPTED0.06 s3details
#24ACCEPTED0.06 s3details
#25ACCEPTED0.05 s3details
#26ACCEPTED0.06 s3details
#27ACCEPTED0.06 s3details
#28ACCEPTED0.05 s3details
#29ACCEPTED0.04 s3details
#30ACCEPTED0.04 s3details
#31ACCEPTED0.14 s4details
#32ACCEPTED0.68 s4details
#33ACCEPTED0.13 s4details
#34ACCEPTED0.58 s4details
#35ACCEPTED0.56 s4details
#36ACCEPTED0.56 s4details
#37ACCEPTED0.65 s4details
#38ACCEPTED0.50 s4details
#39ACCEPTED0.79 s4details
#40ACCEPTED0.53 s4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:84:6: warning: unused variable 'preeeV' [-Wunused-variable]
  int preeeV;
      ^

Code

#include <bits/stdc++.h>
using namespace std;
int n;
inline int subsqcnt(unsigned int asd) {
if(asd==0)
return 1;
else if(asd==1)
return 2;
else
return subsqcnt(asd-2) + subsqcnt(asd-1) + 1;
}
int pienin=999999;
vector<pair<int, bitset<32>>> tulokset;
inline void haku(int yk, int nl, int count, bool kumpi, bitset<32> bs, int length) {
int prev = count;
count *= 2;
if(kumpi) {
bs[length] = false;
count-= nl;
nl = prev;
} else {
bs[length] = true;
count -= yk;
yk = prev;
}
length++;
if(length<pienin) {
if(count-1==n) {
pienin=length;
tulokset.push_back(make_pair(length, bs));
} else if(count<n && length<29) {
haku(yk, nl, count, true, bs, length);
haku(yk, nl, count, false, bs, length);
} else {
// Do nothing
}
}
}
bool compsize(pair<int, bitset<32>> p1, pair<int, bitset<32>> p2) {
return (get<0>(p1)<=get<0>(p2));
}
inline int uniqsubBIT(bitset<32> bs, int length) {
int yk = 1;
int nl = 0;
int count = 2;
int prev;
for(int i=length-2; i>=0; i--) {
prev = count;
count *= 2;
if(bs[i]==true) {
count -= nl;
nl = prev;
} else {
count -= yk;
yk = prev;
}
}
return count;
}
int main() {
cin >> n;
if(n>=5000) {
haku(1, 0, 2, true, bitset<32>(1), 1);
sort(tulokset.begin(), tulokset.end(), compsize);
cout << get<1>(tulokset[0]).to_string().substr(32-get<0>(tulokset[0]), 31);
return 0;
}
int bp = 1;
for(int i=0; i<n; i++) {
bp = i;
if(subsqcnt(i)-1>=n)
break;
}
einain:
int ff = pow(2, bp)/2;
int preeeV;
for(int i=0; i<ff; i++) {
if(i%32==0&&__builtin_popcount(i)==1&&i>2){
herranpieksut:
int fhj = i;
int huhu=1;
while(fhj>=2) {
fhj/=2;
huhu++;
}
int verytemp =(4*pow(2,huhu)-3-(-pow(-1,huhu)))/6+1;
bitset<32> bst(verytemp);
if(uniqsubBIT(bst, bp)-1<n) {
i = pow(2, huhu);
continue;
}
}
bitset<32> bs(i);
int nnnnnn = uniqsubBIT(bs, bp);
if(nnnnnn-1 == n) {
cout << bs.to_string().substr(32-bp);
return 0;
}
if(nnnnnn*2<n) {
i++;
if(i%32==0&&__builtin_popcount(i)==1&&i>2)
goto herranpieksut;
}
}
bp++;
goto einain;
}

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
01

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
001

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
0001

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
0010

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
0110

Test 11

Group: 2

Verdict: ACCEPTED

input
38

correct output
1101011

user output
0010100

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
010001001

Test 14

Group: 2

Verdict: ACCEPTED

input
25

correct output
110010

user output
001101

Test 15

Group: 2

Verdict: ACCEPTED

input
82

correct output
111001101

user output
001101110

Test 16

Group: 2

Verdict: ACCEPTED

input
94

correct output
1100011110

user output
0011100001

Test 17

Group: 2

Verdict: ACCEPTED

input
100

correct output
1111001001

user output
0001100011

Test 18

Group: 2

Verdict: ACCEPTED

input
99

correct output
110010010

user output
001101101

Test 19

Group: 2

Verdict: ACCEPTED

input
98

correct output
110110010

user output
001001101

Test 20

Group: 2

Verdict: ACCEPTED

input
92

correct output
100110001

user output
011001110

Test 21

Group: 3

Verdict: ACCEPTED

input
1666

correct output
101101100100101

user output
010010011011010

Test 22

Group: 3

Verdict: ACCEPTED

input
897

correct output
11101001101010

user output
00010110010101

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
000010101001011010

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
0100110101011010

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
00101010010101001

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
000100110011010110

Test 29

Group: 3

Verdict: ACCEPTED

input
4611

correct output
11010101010101100

user output
00101010101010011

Test 30

Group: 3

Verdict: ACCEPTED

input
4917

correct output
10110100101010110

user output
01001011010101001

Test 31

Group: 4

Verdict: ACCEPTED

input
178555

correct output
1011010110110101010110110

user output
0100101001001010101001001

Test 32

Group: 4

Verdict: ACCEPTED

input
864856

correct output
10111010110110100100101010010

user output
10100111011010110110101011001

Test 33

Group: 4

Verdict: ACCEPTED

input
112146

correct output
1101110101011001100100110

user output
1100110100101010001010001

Test 34

Group: 4

Verdict: ACCEPTED

input
741124

correct output
1011010011010101100101011010

user output
0100101100101010011010100101

Test 35

Group: 4

Verdict: ACCEPTED

input
511902

correct output
1011010100011010100101001110

user output
1001001101011010101010100001

Test 36

Group: 4

Verdict: ACCEPTED

input
920019

correct output
11100100101101010101001101010

user output
10100110101011010011001010001

Test 37

Group: 4

Verdict: ACCEPTED

input
933943

correct output
10101011010100100110100111001

user output
10101011010100100110100111001

Test 38

Group: 4

Verdict: ACCEPTED

input
973410

correct output
1011010101011010101010101001

user output
1011010101011010101010101001

Test 39

Group: 4

Verdict: ACCEPTED

input
954943

correct output
10110110010011010100100110101

user output
01010010001101010010110101001

Test 40

Group: 4

Verdict: ACCEPTED

input
911674

correct output
1010110010110101010101010110

user output
0101001101001010101010101001