CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:Chatne
Submission time:2015-09-28 14:25:05
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#20.13 s1details
#3ACCEPTED0.06 s1details
#40.06 s1details
#50.06 s1details
#60.14 s1details
#70.14 s1details
#8ACCEPTED0.05 s1details
#90.13 s1details
#10ACCEPTED0.06 s1details
#11ACCEPTED0.05 s1details
#120.13 s1details
#13ACCEPTED0.05 s1details
#14ACCEPTED0.06 s1details
#150.14 s1details
#160.06 s1details
#17ACCEPTED0.06 s1details
#180.05 s1details
#190.05 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.06 s2details
#220.06 s2details
#23ACCEPTED0.05 s2details
#240.14 s2details
#250.05 s2details
#260.05 s2details
#270.07 s2details
#280.06 s2details
#290.06 s2details
#30ACCEPTED0.06 s2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.06 s2details
#330.12 s2details
#340.05 s2details
#350.14 s2details
#36ACCEPTED0.07 s2details
#37ACCEPTED0.05 s2details
#380.15 s2details
#390.05 s2details
#400.05 s2details
#41ACCEPTED0.05 s3details
#420.05 s3details
#43ACCEPTED0.05 s3details
#440.04 s3details
#450.06 s3details
#460.14 s3details
#47ACCEPTED0.06 s3details
#48ACCEPTED0.05 s3details
#490.05 s3details
#500.06 s3details
#510.05 s3details
#52ACCEPTED0.05 s3details
#53ACCEPTED0.06 s3details
#540.05 s3details
#550.14 s3details
#56ACCEPTED0.06 s3details
#57ACCEPTED0.05 s3details
#580.15 s3details
#590.06 s3details
#600.15 s3details
#61ACCEPTED0.05 s4details
#620.06 s4details
#630.05 s4details
#640.05 s4details
#65ACCEPTED0.05 s4details
#660.15 s4details
#670.05 s4details
#680.15 s4details
#69ACCEPTED0.05 s4details
#700.06 s4details
#71ACCEPTED0.05 s4details
#720.06 s4details
#73ACCEPTED0.05 s4details
#740.06 s4details
#750.13 s4details
#76--4details
#77--4details
#78--4details
#79--4details
#80--4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:17:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < bitrow.length(); i++) {
                    ^
input/code.cpp:43:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 2; i < dlist.size(); i++) {
                      ^
input/code.cpp:76:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < dlist.size() - 2; i++) {
                      ^
input/code.cpp:94:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < dlist.size(); i++) {
                      ^
input/code.cpp:117:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < moves.size(); i++) {
                       ^

Code

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

using namespace std;

int main() {
	cin.sync_with_stdio(false);

	string bitrow;
	cin >> bitrow;

	int counter(vector<int> dlist, int index);
	vector<int> dlist;
	int curid = 0;
	int count = 0;
	for (int i = 0; i < bitrow.length(); i++) {
		if (bitrow[i] == bitrow[curid]) {
			count++;
		}
		else {
			if (count > 1) {
				dlist.push_back(1);
			}
			else {
				dlist.push_back(0);
			}
			curid = i;
			count = 1;
		}
	}
	if (count > 1) {
		dlist.push_back(1);
	}
	else {
		dlist.push_back(0);
	}

	vector<int> moves;
	while (1) { 
		if (dlist.size() > 2) {
			int pos = -1;
			for (int i = 2; i < dlist.size(); i++) {
				if ((dlist[i - 2] == 0) && (dlist[i - 1] == 1) && (dlist[i] == 0)) {
					pos = i - 1;
					break;
				}
			}
			if (pos != -1) {
				moves.push_back(counter(dlist, pos));
				dlist.erase(dlist.begin() + pos - 1);
				dlist.erase(dlist.begin() + pos);
				continue;
			}

			pos = -1;
			int len = dlist.size();
			for (int i = 1; i < len-1; i++) {
				if ((dlist[i - 1] == 0) && (dlist[i] == 1) && (dlist[i + 1] == 1) && (i != len - 1)) {
					pos = i;
					break;
				}
				if ((dlist[i - 1] == 1) && (dlist[i] == 1) && (dlist[i + 1] == 0) && (i != 1)) {
					pos = i+1;
					break;
				}
			}
			if (pos != -1) {
				moves.push_back(counter(dlist, pos));
				dlist.erase(dlist.begin() + pos - 2);
				dlist.erase(dlist.begin() + pos - 1);
				continue;
			}

			pos = -1;
			for (int i = 0; i < dlist.size() - 2; i++) {
				if ((dlist[i] == 1) && (dlist[i + 1] == 1) && (dlist[i + 2] == 1)) {
					pos = i + 1;
					break;
				}
			}
			if (pos != -1) {
				moves.push_back(counter(dlist, pos));
				dlist.erase(dlist.begin() + pos - 1);
				dlist.erase(dlist.begin() + pos - 1);
				continue;
			}

			cout << "QAQ";
			break;
		}
		else if (dlist.size() == 2) {
			int pos = -1;
			for (int i = 0; i < dlist.size(); i++) {
				if (dlist[i] == 1) {
					pos = i;
					break;
				}
			}
			if (pos != -1) {
				moves.push_back(counter(dlist, pos));
				dlist.erase(dlist.begin() + pos - 1);
				continue;
			}
			else {
				cout << "QAQ";
				break;
			}

		}
		else {
			if (dlist[0] == 0) {
				cout << "QAQ";
			}
			else {
				cout << moves.size() + 1 << endl;
				for (int i = 0; i < moves.size(); i++) {
					cout << moves[i] << " ";
				}
				cout << 1;
			}
			break;
		}
	}
}

int counter(vector<int> dlist, int index) {
	int subcount = 1;
	for (int j = 0; j < index; j++) {
		if (dlist[j] == 1) {
			subcount++;
		}
	}
	return subcount;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Group: 1

Verdict:

input
0000001001

correct output
3
1 1 1 

user output
3

Error:
*** Error in `input/code': double free or corruption (out): 0x00000000011090a0 ***

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

user output
3
1 2 1

Test 4

Group: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
QAQ

Test 5

Group: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
QAQ

Test 6

Group: 1

Verdict:

input
1111110110

correct output
3
1 1 1 

user output
3

Error:
*** Error in `input/code': double free or corruption (out): 0x000000000253f0a0 ***

Test 7

Group: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
3

Error:
*** Error in `input/code': double free or corruption (out): 0x0000000000fab0a0 ***

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
2

Error:
*** Error in `input/code': double free or corruption (out): 0x0000000001a3a0c0 ***

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

correct output
3
2 1 1 

user output
3
1 2 1

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:

input
1101101100

correct output
4
1 2 1 1 

user output
4

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

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

correct output
3
1 1 1 

user output
3
1 1 1

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
4
2 2 2 1

Test 15

Group: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
(empty)

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

Test 16

Group: 1

Verdict:

input
0011011100

correct output
3
3 2 1 

user output
QAQ

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Group: 1

Verdict:

input
1101100111

correct output
3
2 2 1 

user output
3
2 1 1

Test 19

Group: 1

Verdict:

input
0110000100

correct output
3
2 1 1 

user output
QAQ

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000

correct output
QAQ

user output
QAQ

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

Test 22

Group: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
QAQ

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

correct output
4
1 1 1 1 

user output
4
1 2 1 1

Test 24

Group: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
2

Error:
*** Error in `input/code': double free or corruption (out): 0x00000000021690c0 ***

Test 25

Group: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
QAQ

Test 26

Group: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
QAQ

Test 27

Group: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
QAQ

Test 28

Group: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
QAQ

Test 29

Group: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
QAQ

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

correct output
4
1 1 1 1 

user output
4
2 2 1 1

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
2 2 1 1

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
2
2 1

Test 33

Group: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
4

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

Test 34

Group: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
QAQ

Test 35

Group: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
(empty)

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

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

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

user output
31

Error:
*** Error in `input/code': double free or corruption (out): 0x000000000246b250 ***

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
QAQ

Test 40

Group: 2

Verdict:

input
011010000011111011110000110011...

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

user output
QAQ

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Group: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
QAQ

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

correct output
4
2 1 1 1 

user output
4
3 1 1 1

Test 44

Group: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
QAQ

Test 45

Group: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
3
2 1 1

Test 46

Group: 3

Verdict:

input
0011100011

correct output
3
1 2 1 

user output
3

Error:
*** Error in `input/code': double free or corruption (out): 0x00000000019b00a0 ***

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

correct output
3
1 1 1 

user output
3
1 1 1

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
3
2 2 1

Test 49

Group: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
QAQ

Test 50

Group: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
QAQ

Test 51

Group: 3

Verdict:

input
1000111011

correct output
3
2 1 1 

user output
QAQ

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
3
1 2 1

Test 54

Group: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
3
2 1 1

Test 55

Group: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
(empty)

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

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

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

user output
1501

Error:
*** Error in `input/code': double free or corruption (out): 0x000000000185d110 ***

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
QAQ

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

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

user output
1272

Error:
*** Error in `input/code': double free or corruption (out): 0x00000000007a8110 ***

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Group: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
QAQ

Test 63

Group: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
QAQ

Test 64

Group: 4

Verdict:

input
1001110001

correct output
3
2 1 1 

user output
QAQ

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1

Test 66

Group: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
4

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

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
QAQ

Test 68

Group: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
4

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

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
2
2 1

Test 70

Group: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
QAQ

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

correct output
3
2 1 1 

user output
3
1 2 1

Test 72

Group: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
3
4 2 1

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
2
2 1

Test 74

Group: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
QAQ

Test 75

Group: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
(empty)

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

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

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
(empty)

Test 80

Group: 4

Verdict:

input
111000110000011000001101010010...

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

user output
(empty)