CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:retki5
Submission time:2015-10-05 18:47:16 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#10.04 s1details
#2ACCEPTED0.05 s1details
#30.14 s1details
#40.05 s1details
#50.16 s1details
#6ACCEPTED0.05 s1details
#70.05 s1details
#8ACCEPTED0.05 s1details
#90.13 s1details
#100.13 s1details
#11ACCEPTED0.05 s1details
#12ACCEPTED0.05 s1details
#130.14 s1details
#14ACCEPTED0.06 s1details
#150.05 s1details
#16ACCEPTED0.06 s1details
#170.05 s1details
#18ACCEPTED0.05 s1details
#190.06 s1details
#200.13 s1details
#210.05 s2details
#220.05 s2details
#230.14 s2details
#240.14 s2details
#250.05 s2details
#260.14 s2details
#270.13 s2details
#280.05 s2details
#290.05 s2details
#300.13 s2details
#310.15 s2details
#32ACCEPTED0.05 s2details
#330.12 s2details
#340.13 s2details
#350.05 s2details
#360.05 s2details
#370.06 s2details
#380.05 s2details
#390.06 s2details
#400.05 s2details
#410.15 s3details
#420.06 s3details
#430.05 s3details
#440.05 s3details
#450.14 s3details
#46ACCEPTED0.05 s3details
#470.14 s3details
#48ACCEPTED0.06 s3details
#490.05 s3details
#500.17 s3details
#510.06 s3details
#52ACCEPTED0.06 s3details
#53ACCEPTED0.05 s3details
#540.15 s3details
#550.05 s3details
#560.06 s3details
#570.05 s3details
#580.06 s3details
#590.05 s3details
#600.05 s3details
#610.12 s4details
#620.05 s4details
#630.14 s4details
#64ACCEPTED0.05 s4details
#65ACCEPTED0.06 s4details
#66ACCEPTED0.06 s4details
#670.05 s4details
#680.15 s4details
#69ACCEPTED0.06 s4details
#700.05 s4details
#710.13 s4details
#720.06 s4details
#73ACCEPTED0.05 s4details
#740.05 s4details
#750.06 s4details
#760.05 s4details
#770.06 s4details
#780.06 s4details
#790.06 s4details
#80--4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:12:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < kuk.length(); i++) {
                    ^
input/code.cpp:48:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int a = 0; a < kek.size(); a++) {
                       ^
input/code.cpp:57:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (k == kek.size() - 1) {
          ^
input/code.cpp:71:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (k == kek.size() - 1) break;
          ^
input/code.cpp:74:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < kek.size(); i++) {
                    ^
input/code.cpp:78:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a

Code

#include <iostream>
#include <vector>
int main() {
	std::string kuk;
	std::cin >> kuk;
	int cu[3];
	//1 or 0 - 1 or longer (2)
	std::vector<std::pair<int, int>> kek;
	std::vector<int> ans;
	int lasto = kuk[0] - 48;
	int lastn = 0;
	for (int i = 1; i < kuk.length(); i++) {
		if (lasto != kuk[i] - 48) {
			if (i - lastn > 1) {
				kek.push_back(std::make_pair(kuk[i - 1] - 48, 2));
			}
			else {
				kek.push_back(std::make_pair(kuk[i - 1] - 48, 1));
			}
			lastn = i;
		}
		lasto = kuk[i] - 48;
	}
	int asdf = 1;
	if (kuk.size() - lastn > 1) asdf = 2;
	kek.push_back(std::make_pair(kuk[kuk.size() - 1] - 48, asdf));
	
	int k = 1;
	int tt = 1;
	int found = -1;
	int dd = 1;
	while (true) {
		//std::cout << k << "<k   tt>" << tt << std::endl;
		if (found == -1) {
			if (kek[k].second == 1) {
				found = k;
			}
		}
		else {
			if (kek[k].second == 2) {
				kek.insert(kek.begin() + k - 1, std::make_pair(kek[k - 1].first, 2));
				for (int a = 0; a < 3; a++) {
					kek.erase(kek.begin() + k);
				}
				ans.push_back(k);
				found = -1;
				bool rdy = true;
				for (int a = 0; a < kek.size(); a++) {
					if (kek.at(a).second == 1) rdy = false;
				}
				if (rdy) break;
			}
		}
		if (tt == 1) {
			k++;
			//std::cout << "dsflkj" << std::endl;
			if (k == kek.size() - 1) {
				tt = 2;
				continue;
			}
		}
		if (tt == 2) {
			k--;
			if (k == 0) {
				tt = 3;
				continue;
			}
		}
		if (tt == 3) {
			k++;
			if (k == kek.size() - 1) break;
		}
	}
	for (int i = 0; i < kek.size(); i++) {
		ans.push_back(1);
	}
	std::cout << ans.size() << std::endl;
	for (int i = 0; i < ans.size(); i++) {
		std::cout << ans[i] << " ";
	}
	std::cout << "\n";
	return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1011001010

correct output
QAQ

user output
6
2 1 1 1 1 1 

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
2 1 1 

Test 3

Group: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
(empty)

Test 4

Group: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
4
2 4 1 1 

Test 5

Group: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
(empty)

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
2 1 1 

Test 7

Group: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
3
2 1 1 

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1 

Test 9

Group: 1

Verdict:

input
1111111100

correct output
2
1 1 

user output
(empty)

Test 10

Group: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
(empty)

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
2 1 1 

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

user output
5
2 1 1 1 1 

Test 13

Group: 1

Verdict:

input
0100111110

correct output
3
1 1 1 

user output
(empty)

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
5
3 2 1 1 1 

Test 15

Group: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
4
2 1 1 1 

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
4
3 1 1 1 

Test 17

Group: 1

Verdict:

input
1100101011

correct output
QAQ

user output
5
6 1 1 1 1 

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
4
2 1 1 1 

Test 19

Group: 1

Verdict:

input
0110000100

correct output
3
2 1 1 

user output
3
4 1 1 

Test 20

Group: 1

Verdict:

input
0000101000

correct output
QAQ

user output
(empty)

Error:
*** Error in `input/code': free(): invalid next size (fast): 0x0000000000eab0d0 ***

Test 21

Group: 2

Verdict:

input
1110010100

correct output
QAQ

user output
4
5 1 1 1 

Test 22

Group: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
3
3 1 1 

Test 23

Group: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
(empty)

Test 24

Group: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
(empty)

Test 25

Group: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
2
1 1 

Test 26

Group: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
(empty)

Test 27

Group: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
(empty)

Test 28

Group: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
3
3 1 1 

Test 29

Group: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
4
2 1 1 1 

Test 30

Group: 2

Verdict:

input
0001011011

correct output
4
1 1 1 1 

user output
(empty)

Test 31

Group: 2

Verdict:

input
0010110011

correct output
4
1 1 1 1 

user output
(empty)

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
3
1 1 1 

Test 33

Group: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
(empty)

Test 34

Group: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
(empty)

Test 35

Group: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
4
2 1 1 1 

Test 36

Group: 2

Verdict:

input
110011001100110011001010101010...

correct output
QAQ

user output
77
70 9 67 1 1 1 1 1 1 1 1 1 1 1 ...

Test 37

Group: 2

Verdict:

input
110011001100110011001100101010...

correct output
QAQ

user output
71
62 11 59 1 1 1 1 1 1 1 1 1 1 1...

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

correct output
31
1 20 20 20 20 20 20 20 20 20 2...

user output
57
40 19 37 1 1 1 1 1 1 1 1 1 1 1...

Test 39

Group: 2

Verdict:

input
010101010101010101010101010101...

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
92
46 45 44 1 1 1 1 1 1 1 1 1 1 1...

Test 40

Group: 2

Verdict:

input
011010000011111011110000110011...

correct output
23
13 13 12 11 11 11 11 10 9 9 9 ...

user output
31
4 12 15 18 23 28 29 22 17 14 1...

Test 41

Group: 3

Verdict:

input
0010101000

correct output
QAQ

user output
(empty)

Error:
*** Error in `input/code': free(): invalid next size (fast): 0x000000000122e0d0 ***

Test 42

Group: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
4
2 3 1 1 

Test 43

Group: 3

Verdict:

input
0100110110

correct output
4
2 1 1 1 

user output
4
2 3 1 1 

Test 44

Group: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
2
1 1 

Test 45

Group: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
(empty)

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

user output
4
1 1 1 1 

Test 47

Group: 3

Verdict:

input
0100111100

correct output
3
1 1 1 

user output
(empty)

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
4
2 1 1 1 

Test 49

Group: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
4
2 2 1 1 

Test 50

Group: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
(empty)

Test 51

Group: 3

Verdict:

input
1000111011

correct output
3
2 1 1 

user output
3
4 1 1 

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

correct output
2
1 1 

user output
2
1 1 

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

correct output
3
2 1 1 

user output
4
1 1 1 1 

Test 54

Group: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
(empty)

Test 55

Group: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
4
2 1 1 1 

Test 56

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
3997
3500 499 3497 1 1 1 1 1 1 1 1 ...

Test 57

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
3745
3124 623 3121 1 1 1 1 1 1 1 1 ...

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
1501
1 1000 1000 1000 1000 1000 100...

user output
2997
2000 999 1997 1 1 1 1 1 1 1 1 ...

Test 59

Group: 3

Verdict:

input
010101010101010101010101010101...

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
4992
2496 2495 2494 1 1 1 1 1 1 1 1...

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

correct output
1272
1 1 648 647 646 646 645 645 64...

user output
1726
7 9 13 15 20 24 27 32 34 36 39...

Test 61

Group: 4

Verdict:

input
1110101110

correct output
QAQ

user output
(empty)

Test 62

Group: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
4
5 2 1 1 

Test 63

Group: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
(empty)

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

correct output
3
2 1 1 

user output
3
3 1 1 

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1 

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

correct output
4
1 1 1 1 

user output
4
2 1 1 1 

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
5
2 1 1 1 1 

Test 68

Group: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
(empty)

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
3
1 1 1 

Test 70

Group: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
5
3 2 1 1 1 

Test 71

Group: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
(empty)

Test 72

Group: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
4
4 1 1 1 

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
3
1 1 1 

Test 74

Group: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
5
2 1 1 1 1 

Test 75

Group: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
4
2 1 1 1 

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
79997
70000 9999 69997 1 1 1 1 1 1 1...

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
74997
62500 12499 62497 1 1 1 1 1 1 ...

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
30001
1 20000 20000 20000 20000 2000...

user output
59997
40000 19999 39997 1 1 1 1 1 1 ...

Test 79

Group: 4

Verdict:

input
010101010101010101010101010101...

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
99992
49996 49995 49994 1 1 1 1 1 1 ...

Test 80

Group: 4

Verdict:

input
111000110000011000001101010010...

correct output
25011
1 12471 12470 12469 12468 1246...

user output
(empty)