CSES - Datatähti 2018 alku - Results
Submission details
Task:Bittijono
Sender:mika
Submission time:2017-10-12 16:34:15 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1--1details
#2--1details
#3--1details
#4--1details
#5--1details
#6--1details
#7--1details
#8--1details
#9--1details
#10--1details
#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
#32--4details
#33--4details
#34--4details
#35--4details
#36--4details
#37--4details
#38--4details
#39--4details
#40--4details

Compiler report

input/code.cpp: In function 'int alijonoc(std::string)':
input/code.cpp:15:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < s.length(); i++)
                                ^
input/code.cpp:18:19: warning: array subscript has type 'char' [-Wchar-subscripts]
    c = c - cc[s[i]] + ccc;
                   ^
input/code.cpp:19:11: warning: array subscript has type 'char' [-Wchar-subscripts]
    cc[s[i]] = ccc;
           ^
input/code.cpp: In function 'bool scuffed(int, std::string, int)':
input/code.cpp:34:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (n > 10 && s.length() > n / 2)
                                  ^
input/code.cpp: In function 'void strr(long int, std::vector<std::basic_string<char> >&, std::string)':
input/code.cpp:65:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (s.size() < max_length)
                  ^
i...

Code

#include <iostream>
#include <string>
#include <vector>
#include <ctime>

using namespace std;

/*namespace abcccc
{*/

	int alijonoc(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;
	}

	bool scuffed(int n, string s, int lastbit)
	{
		int c = alijonoc(s);

		if (c == n) {
			cout << s << endl;
			return true;
		}
		if (c > n)
			return false;
		if (n > 10 && s.length() > n / 2)
			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 (scuffed(n, ns, k))
				return true;
		}
		return false;
	}

	void strr(long n, vector<string> &v, string s = "")
	{
		int max_length = n; // n < 4
		if (n > 4)
			max_length = (n / 2) + 1;
		if (n > 19)
			max_length = 10;
		if (n > 150)
			max_length = 15;
		if (n > 1500)
			max_length = 16;
		if (n > 3000)
			max_length = 18;

		if (s.size() < max_length)
		{
			for (int i = 0; i < 2; i++)
			{
				string sn = s + to_string(i);
				v.push_back(sn);

				strr(n, v, sn);
			}
		}
	}

	string lowest(int n)
	{
		vector<string> vv;
		strr(n, vv);
		string lowstr = "";
		for (int i = 0; i < vv.size(); i++)
		{
			int p = alijonoc(vv[i]);

			if (p == n)
			{
				if (lowstr == "" || lowstr.size() > vv[i].size())
					lowstr = vv[i];
			}
		}
		return lowstr;
	}
	// 5 = 100
	// 6 = 101

	int main()
	{
		for (int i = 1; i <= 1000; i++)
		{
			string s = lowest(i);
			cout << i << ": " << s <<  "  length=" << s.length() << endl;
		}
		system("pause");
		while (true) {
			string s;
			getline(cin, s);

			cout << alijonoc(s) << endl;
			if (s == "")
				break;
		}

		while (true)
		{
			int n;
			cin >> n;
			cout << "sure: " << lowest(n) << endl;
			scuffed(n, "", 0);
		}

		

		clock_t begin = clock();

		clock_t end = clock();
		double elapsed_secs = double(end - begin) / CLOCKS_PER_SEC;
		cout << "calculated in " << elapsed_secs << endl;

		system("pause");

		return 0;
	}
//}

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
(empty)

Test 2

Group: 1

Verdict:

input
2

correct output
11

user output
(empty)

Test 3

Group: 1

Verdict:

input
3

correct output
10

user output
(empty)

Test 4

Group: 1

Verdict:

input
4

correct output
1111

user output
(empty)

Test 5

Group: 1

Verdict:

input
5

correct output
110

user output
(empty)

Test 6

Group: 1

Verdict:

input
6

correct output
101

user output
(empty)

Test 7

Group: 1

Verdict:

input
7

correct output
1110

user output
(empty)

Test 8

Group: 1

Verdict:

input
8

correct output
1100

user output
(empty)

Test 9

Group: 1

Verdict:

input
9

correct output
1101

user output
(empty)

Test 10

Group: 1

Verdict:

input
10

correct output
1001

user output
(empty)

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)