CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:Chatne
Submission time:2015-09-28 14:57:51
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s1details
#70.06 s1details
#8ACCEPTED0.06 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.05 s1details
#12ACCEPTED0.05 s1details
#13ACCEPTED0.05 s1details
#14ACCEPTED0.05 s1details
#150.05 s1details
#16ACCEPTED0.06 s1details
#17ACCEPTED0.05 s1details
#18ACCEPTED0.06 s1details
#19ACCEPTED0.06 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.05 s2details
#22ACCEPTED0.05 s2details
#230.05 s2details
#24ACCEPTED0.05 s2details
#25ACCEPTED0.05 s2details
#26ACCEPTED0.05 s2details
#27ACCEPTED0.06 s2details
#28ACCEPTED0.05 s2details
#29ACCEPTED0.06 s2details
#30ACCEPTED0.05 s2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.06 s2details
#33ACCEPTED0.06 s2details
#34ACCEPTED0.05 s2details
#350.06 s2details
#36ACCEPTED0.05 s2details
#37ACCEPTED0.04 s2details
#38ACCEPTED0.05 s2details
#390.05 s2details
#40ACCEPTED0.06 s2details
#41ACCEPTED0.07 s3details
#42ACCEPTED0.05 s3details
#43ACCEPTED0.06 s3details
#44ACCEPTED0.06 s3details
#45ACCEPTED0.05 s3details
#46ACCEPTED0.05 s3details
#47ACCEPTED0.05 s3details
#48ACCEPTED0.06 s3details
#49ACCEPTED0.05 s3details
#50ACCEPTED0.05 s3details
#51ACCEPTED0.04 s3details
#52ACCEPTED0.06 s3details
#53ACCEPTED0.05 s3details
#54ACCEPTED0.05 s3details
#550.06 s3details
#56ACCEPTED0.06 s3details
#57ACCEPTED0.06 s3details
#58ACCEPTED0.06 s3details
#590.06 s3details
#600.05 s3details
#61ACCEPTED0.05 s4details
#62ACCEPTED0.05 s4details
#63ACCEPTED0.06 s4details
#64ACCEPTED0.04 s4details
#65ACCEPTED0.05 s4details
#66ACCEPTED0.06 s4details
#670.05 s4details
#68ACCEPTED0.05 s4details
#69ACCEPTED0.06 s4details
#70ACCEPTED0.05 s4details
#71ACCEPTED0.05 s4details
#72ACCEPTED0.06 s4details
#73ACCEPTED0.05 s4details
#740.06 s4details
#750.06 s4details
#76--4details
#77--4details
#78--4details
#79--4details
#80--4details

Code

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

using namespace std;


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

	string bitrow;
	cin >> bitrow;

	long long counter(vector<long long> dlist, long long index);
	vector<long long> dlist;
	long long curid = 0;
	long long count = 0;
	for (long long i = 0; i < (long long)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<long long> moves;
	while (1) {

		if (dlist.size() > 2) {
			// Delete 010
			long long pos = -1;
			for (long long i = 2; i < (long long)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;
			}

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


			// Delete 111
			pos = -1;
			for (long long i = 0; i < (long long)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;
			}

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

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

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

long long counter(vector<long long> dlist, long long index) {
	long long subcount = 1;
	for (long long 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: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
2 1 1

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

input
0100100100

correct output
4
2 1 1 1 

user output
4
1 2 1 1

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

correct output
4
2 1 1 1 

user output
4
3 2 1 1

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
QAQ

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

correct output
2
1 1 

user output
2
1 1

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

input
1101101100

correct output
4
1 2 1 1 

user output
4
2 2 1 1

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
QAQ

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
3
2 2 1

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
3
2 2 1

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

correct output
3
2 1 1 

user output
3
2 1 1

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

input
1110010000

correct output
3
2 1 1 

user output
3
2 1 1

Test 23

Group: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
QAQ

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

correct output
2
1 1 

user output
2
1 1

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

correct output
2
2 1 

user output
2
2 1

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

correct output
4
2 1 1 1 

user output
4
2 2 1 1

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

correct output
3
2 1 1 

user output
3
1 2 1

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

correct output
3
2 1 1 

user output
3
2 1 1

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

correct output
3
3 2 1 

user output
3
3 2 1

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

input
1110100110

correct output
4
1 1 1 1 

user output
4
2 2 1 1

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

correct output
4
2 1 1 1 

user output
4
1 2 1 1

Test 35

Group: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

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

input
110011001100110011001100110011...

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

user output
31
20 19 18 17 16 15 14 13 12 11 ...

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

input
011010000011111011110000110011...

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

user output
23
1 2 3 6 5 6 5 4 5 4 3 4 3 3 3 ...

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

correct output
4
2 1 1 1 

user output
4
1 1 2 1

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

input
1110000001

correct output
2
2 1 

user output
2
2 1

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

correct output
3
2 2 1 

user output
3
2 2 1

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

user output
3
2 1 1

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

input
0100100010

correct output
4
2 1 1 1 

user output
4
1 2 1 1

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

correct output
4
2 1 1 1 

user output
4
3 2 1 1

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

correct output
3
2 1 1 

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

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

correct output
3
2 2 1 

user output
3
2 2 1

Test 55

Group: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

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

input
110011001100110011001100110011...

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

user output
1501
1000 999 998 997 996 995 994 9...

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
QAQ

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

correct output
3
2 2 1 

user output
3
2 2 1

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

correct output
3
2 1 1 

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

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
QAQ

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

correct output
4
1 1 1 1 

user output
4
2 2 1 1

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
2
2 1

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

correct output
4
2 2 2 1 

user output
4
2 2 2 1

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

input
1100110111

correct output
3
3 2 1 

user output
3
3 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
QAQ

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)