CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:mika
Submission time:2017-10-10 22:59:36 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.07 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.04 s1details
#7ACCEPTED0.06 s1details
#80.06 s1details
#90.05 s1details
#10ACCEPTED0.05 s1details
#110.05 s2details
#120.07 s2details
#13ACCEPTED0.06 s2details
#140.04 s2details
#150.08 s2details
#160.05 s2details
#170.06 s2details
#180.05 s2details
#190.06 s2details
#200.04 s2details
#210.04 s3details
#220.05 s3details
#230.08 s3details
#240.06 s3details
#250.07 s3details
#26ACCEPTED0.07 s3details
#270.07 s3details
#280.05 s3details
#290.09 s3details
#300.04 s3details
#31--4details
#32--4details
#330.72 s4details
#34--4details
#35--4details
#36--4details
#37--4details
#38--4details
#39--4details
#40--4details

Compiler report

input/code.cpp: In function 'int subb_t(std::string)':
input/code.cpp:12:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < s.length(); i++)
                               ^
input/code.cpp:15:18: warning: array subscript has type 'char' [-Wchar-subscripts]
   c = c - cc[s[i]] + ccc;
                  ^
input/code.cpp:16:10: warning: array subscript has type 'char' [-Wchar-subscripts]
   cc[s[i]] = ccc;
          ^

Code

#include <iostream>
#include <string>
#include <vector>
#include <bitset>

using namespace std;

int subb_t(string s)
{
	int c = 0;
	int cc[256] = {0};
	for (int i = 0; i < s.length(); i++)
	{
		int ccc = 1 + c;
		c = c - cc[s[i]] + ccc;
		cc[s[i]] = ccc;
	}
	return c;
}

int subb_l(string s)
{
	return 0;
}

bool find(int n, string s = "", int lastbit = 0)
{
	int c = subb_t(s);

	if (c == n) {
		cout << s << endl;
		return true;
	}
	if (c > n)
		return false;

	for (int i = 0; i < 2; i++)
	{
		int k = 0;
		if (i == 0 && lastbit == 0)
			k = 1;
		if (i == 1 && lastbit == 1)
			k = 0;
		string ns = s + to_string(k);
		if (find(n, ns, k))
			return true;
	}
	return false;
}

int main()
{
	int n;
	cin >> n;
	find(n);

	//system("pause");
	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
00

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
0000

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
110

user output
100

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
1000

Test 8

Group: 1

Verdict:

input
8

correct output
1100

user output
00000000

Test 9

Group: 1

Verdict:

input
9

correct output
1101

user output
10000

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
1001

user output
1001

Test 11

Group: 2

Verdict:

input
38

correct output
1101011

user output
10010000

Test 12

Group: 2

Verdict:

input
13

correct output
11011

user output
1000000

Test 13

Group: 2

Verdict: ACCEPTED

input
90

correct output
111001010

user output
100100010

Test 14

Group: 2

Verdict:

input
25

correct output
110010

user output
1000000000000

Test 15

Group: 2

Verdict:

input
82

correct output
111001101

user output
1000000000000000000001

Test 16

Group: 2

Verdict:

input
94

correct output
1100011110

user output
1001000000000000

Test 17

Group: 2

Verdict:

input
100

correct output
1111001001

user output
1000001000000

Test 18

Group: 2

Verdict:

input
99

correct output
110010010

user output
1010000000001

Test 19

Group: 2

Verdict:

input
98

correct output
110110010

user output
1000000010000

Test 20

Group: 2

Verdict:

input
92

correct output
100110001

user output
1010000010

Test 21

Group: 3

Verdict:

input
1666

correct output
101101100100101

user output
10101000000000000000001001

Test 22

Group: 3

Verdict:

input
897

correct output
11101001101010

user output
101001000100001

Test 23

Group: 3

Verdict:

input
4466

correct output
111101010110100101

user output
10101001000000000000100000

Test 24

Group: 3

Verdict:

input
4240

correct output
11011001011010101

user output
101010000100000000001000

Test 25

Group: 3

Verdict:

input
3089

correct output
1011001010100101

user output
101001000000000000000000000000...

Test 26

Group: 3

Verdict: ACCEPTED

input
4697

correct output
11010101101010110

user output
10101001001001010

Test 27

Group: 3

Verdict:

input
4608

correct output
11010110101001010

user output
101010001000000100000000

Test 28

Group: 3

Verdict:

input
4625

correct output
111011001100101001

user output
10101010010000001000

Test 29

Group: 3

Verdict:

input
4611

correct output
11010101010101100

user output
10101000000000001010100

Test 30

Group: 3

Verdict:

input
4917

correct output
10110100101010110

user output
10101010000100100000

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
101010100000100010000000000000...

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)