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

Compiler report

input/code.cpp: In function 'unsigned int subsqcnt(unsigned int)':
input/code.cpp:8:15: warning: unused variable 'ff' [-Wunused-variable]
  unsigned int ff;
               ^
input/code.cpp: In function 'int main()':
input/code.cpp:39:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<n; i++) {
                 ^
input/code.cpp:58:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(uniqsubBIT(bst.flip(), bp)-1<n) {
                                     ^
input/code.cpp:64:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(nnnnnn-1 == n) {
                  ^
input/code.cpp:68:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(nnnnnn*2<n) /// ei kai toimi
               ^

Code

#include <bits/stdc++.h>
using namespace std;
unsigned int n;
inline unsigned int subsqcnt(unsigned int asd) {
unsigned int ff;
if(asd==0)
return 1;
else if(asd==1)
return 2;
else
return subsqcnt(asd-2) + subsqcnt(asd-1) + 1;
}
inline int uniqsubBIT(bitset<32> bs, int length) {
int yk = 0;
int nl = 0;
int count = 1;
for(int i=length-1; i>=0; i--) {
int prev = count;
count *= 2;
if(bs[i]==false) {
if(nl > 0)
count -= nl;
nl = prev;
} else {
if(yk>0)
count -= yk;
yk = prev;
}
}
return count;
}
int main() {
cin >> n;
int bp = 1;
for(int i=0; i<n; i++) {
bp = i;
if(subsqcnt(i)-1>=n)
break;
}
string cur;
einain:
int ff = pow(2, bp)/1.5;
for(int i=0; i<ff; i++) {
bitset<32> bs(i);
if(__builtin_popcount(i)==1&&i>2){
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.flip(), bp)-1<n) {
i = pow(2, huhu);
continue;
}
}
int nnnnnn = uniqsubBIT(bs.flip(), bp);
if(nnnnnn-1 == n) {
cout << bs.to_string().substr(32-bp);
return 0;
}
if(nnnnnn*2<n) /// ei kai toimi
i++;
}
bp++;
goto einain;
}

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
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
110

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
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
1101

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
11011

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
111001101

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
1111001001

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: ACCEPTED

input
92

correct output
100110001

user output
100110001

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
11101001101010

Test 23

Group: 3

Verdict: ACCEPTED

input
4466

correct output
111101010110100101

user output
111101010110100101

Test 24

Group: 3

Verdict: ACCEPTED

input
4240

correct output
11011001011010101

user output
11011001011010101

Test 25

Group: 3

Verdict: ACCEPTED

input
3089

correct output
1011001010100101

user output
1011001010100101

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
11010101101010110

Test 27

Group: 3

Verdict: ACCEPTED

input
4608

correct output
11010110101001010

user output
11010110101001010

Test 28

Group: 3

Verdict: ACCEPTED

input
4625

correct output
111011001100101001

user output
111011001100101001

Test 29

Group: 3

Verdict: ACCEPTED

input
4611

correct output
11010101010101100

user output
11010101010101100

Test 30

Group: 3

Verdict: ACCEPTED

input
4917

correct output
10110100101010110

user output
10110100101010110

Test 31

Group: 4

Verdict: ACCEPTED

input
178555

correct output
1011010110110101010110110

user output
1011010110110101010110110

Test 32

Group: 4

Verdict:

input
864856

correct output
10111010110110100100101010010

user output
(empty)

Test 33

Group: 4

Verdict: ACCEPTED

input
112146

correct output
1101110101011001100100110

user output
1101110101011001100100110

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)