Submission details
Task:Bittipeli
Sender:Chatne
Submission time:2015-10-03 18:03:49 +0300
Language:C++
Status:READY
Result:66
Feedback
subtaskverdictscore
#1ACCEPTED11
#2ACCEPTED27
#3ACCEPTED28
#40
Test results
testverdicttimesubtask
#1ACCEPTED0.06 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.06 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.05 s1details
#12ACCEPTED0.06 s1details
#13ACCEPTED0.05 s1details
#14ACCEPTED0.05 s1details
#15ACCEPTED0.05 s1details
#16ACCEPTED0.06 s1details
#17ACCEPTED0.07 s1details
#18ACCEPTED0.05 s1details
#19ACCEPTED0.06 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.06 s2details
#22ACCEPTED0.05 s2details
#23ACCEPTED0.06 s2details
#24ACCEPTED0.05 s2details
#25ACCEPTED0.05 s2details
#26ACCEPTED0.05 s2details
#27ACCEPTED0.05 s2details
#28ACCEPTED0.05 s2details
#29ACCEPTED0.06 s2details
#30ACCEPTED0.05 s2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.05 s2details
#33ACCEPTED0.06 s2details
#34ACCEPTED0.06 s2details
#35ACCEPTED0.05 s2details
#36ACCEPTED0.05 s2details
#37ACCEPTED0.05 s2details
#38ACCEPTED0.05 s2details
#39ACCEPTED0.06 s2details
#40ACCEPTED0.05 s2details
#41ACCEPTED0.05 s3details
#42ACCEPTED0.05 s3details
#43ACCEPTED0.05 s3details
#44ACCEPTED0.05 s3details
#45ACCEPTED0.05 s3details
#46ACCEPTED0.05 s3details
#47ACCEPTED0.06 s3details
#48ACCEPTED0.05 s3details
#49ACCEPTED0.05 s3details
#50ACCEPTED0.05 s3details
#51ACCEPTED0.05 s3details
#52ACCEPTED0.06 s3details
#53ACCEPTED0.06 s3details
#54ACCEPTED0.05 s3details
#55ACCEPTED0.05 s3details
#56ACCEPTED0.64 s3details
#57ACCEPTED0.64 s3details
#58ACCEPTED0.40 s3details
#59ACCEPTED0.58 s3details
#60ACCEPTED0.23 s3details
#61ACCEPTED0.06 s4details
#62ACCEPTED0.06 s4details
#63ACCEPTED0.05 s4details
#64ACCEPTED0.05 s4details
#65ACCEPTED0.06 s4details
#66ACCEPTED0.05 s4details
#67ACCEPTED0.01 s4details
#68ACCEPTED0.05 s4details
#69ACCEPTED0.05 s4details
#700.05 s4details
#71ACCEPTED0.06 s4details
#72ACCEPTED0.04 s4details
#73ACCEPTED0.05 s4details
#74ACCEPTED0.05 s4details
#75ACCEPTED0.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;

	vector<int> grList;

	int curid = 0;
	int count = 0;
	for (int i = 0; i < (int)bitrow.length(); i++) {
		if (bitrow[i] == bitrow[curid]) {
			count++;
		}
		else {
			if (count > 1) {
				grList.push_back(49);
			}
			else {
				grList.push_back(48);
			}
			curid = i;
			count = 1;
		}
	}
	if (count > 1) {
		grList.push_back(49);
	}
	else {
		grList.push_back(48);
	}
	string str(grList.begin(), grList.end());

	vector<int> moves;

	bool fail = false;
	while (1) {
		//cout << str << endl;

		int strlen = str.length();
		if (strlen == 1) {
			if (str == "0") {
				cout << "QAQ";
				fail = true;
				break;
			}
			else {
				moves.push_back(1);
				break;
			}
		}
		else if (strlen == 2) {
			if (str == "00" || str == "01" || str == "10") {
				cout << "QAQ";
				fail = true;
				break;
			}
			else {
				moves.push_back(1);
				moves.push_back(1);
				break;
			}
		}
		else {
			int prio = 0;
			int prioid = 0;
			for (int i = 0; i < strlen - 2; i++) {
				string curstr = str.substr(i, 3);
			
				if (curstr == "010" && i != 0 && i != strlen - 3) {
					prio = 11;
					prioid = i;
					break;
				}
				if ((curstr == "011" || curstr == "110") && i != 0 && i != strlen - 3) {
					prio = 10;
					prioid = i;
					continue;
				}
				if (curstr == "010" && prio < 10) {
					prio = 9;
					prioid = i;
					continue;
				}
				if ((curstr == "011" || curstr == "110") && prio < 9) {
					prio = 8;
					prioid = i;
					continue;
				}
				if (curstr == "111" && i != 0 && i != strlen - 3 && prio < 8) {
					prio = 7;
					prioid = i;
					continue;
				}
				if (curstr == "111" && prio < 7) {
					prio = 6;
					prioid = i;
					continue;
				}
				if (curstr == "000" && prio < 6) {
					prio = 5;
					prioid = i;
					continue;
				}
			}
			if (prio == 5) {
				cout << "QAQ";
				fail = true;
				break;
			}
			else {
				int indx = 0;
				for (int i = 0; i < prioid+1; i++) {
					if (str[i] == 49) {
						indx++;
					}
				}
				moves.push_back(indx+1);
				str.erase(prioid + 2, 1);
				str.erase(prioid, 1);
			}
		}
	}

	if (!fail) {
		int movecount = moves.size();
		cout << movecount << endl;
		for (int i = 0; i < movecount; i++) {
			cout << moves[i] << " ";
		}
	}

	//system("pause");
}

Test details

Test 1

Subtask: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Subtask: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
2 1 1 

Test 3

Subtask: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

user output
3
1 2 1 

Test 4

Subtask: 1

Verdict: ACCEPTED

input
0100100100

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 5

Subtask: 1

Verdict: ACCEPTED

input
1110010110

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 6

Subtask: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
2 1 1 

Test 7

Subtask: 1

Verdict: ACCEPTED

input
0011110001

correct output
3
1 2 1 

user output
3
3 1 1 

Test 8

Subtask: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1 

Test 9

Subtask: 1

Verdict: ACCEPTED

input
1111111100

correct output
2
1 1 

user output
2
1 1 

Test 10

Subtask: 1

Verdict: ACCEPTED

input
1000010011

correct output
3
2 1 1 

user output
3
1 2 1 

Test 11

Subtask: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
2 1 1 

Test 12

Subtask: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

user output
4
2 3 1 1 

Test 13

Subtask: 1

Verdict: ACCEPTED

input
0100111110

correct output
3
1 1 1 

user output
3
1 1 1 

Test 14

Subtask: 1

Verdict: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
4
2 2 2 1 

Test 15

Subtask: 1

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 16

Subtask: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
3
3 2 1 

Test 17

Subtask: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Subtask: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
3
2 2 1 

Test 19

Subtask: 1

Verdict: ACCEPTED

input
0110000100

correct output
3
2 1 1 

user output
3
2 1 1 

Test 20

Subtask: 1

Verdict: ACCEPTED

input
0000101000

correct output
QAQ

user output
QAQ

Test 21

Subtask: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

Test 22

Subtask: 2

Verdict: ACCEPTED

input
1110010000

correct output
3
2 1 1 

user output
3
2 1 1 

Test 23

Subtask: 2

Verdict: ACCEPTED

input
1001101100

correct output
4
1 1 1 1 

user output
4
2 1 1 1 

Test 24

Subtask: 2

Verdict: ACCEPTED

input
0000000111

correct output
2
1 1 

user output
2
1 1 

Test 25

Subtask: 2

Verdict: ACCEPTED

input
0011111110

correct output
2
2 1 

user output
2
2 1 

Test 26

Subtask: 2

Verdict: ACCEPTED

input
1100101100

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 27

Subtask: 2

Verdict: ACCEPTED

input
0111101110

correct output
3
2 1 1 

user output
3
2 1 1 

Test 28

Subtask: 2

Verdict: ACCEPTED

input
0000011011

correct output
3
2 1 1 

user output
3
2 1 1 

Test 29

Subtask: 2

Verdict: ACCEPTED

input
1110011101

correct output
3
3 2 1 

user output
3
3 2 1 

Test 30

Subtask: 2

Verdict: ACCEPTED

input
0001011011

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 31

Subtask: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 32

Subtask: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
2
2 1 

Test 33

Subtask: 2

Verdict: ACCEPTED

input
1110100110

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 34

Subtask: 2

Verdict: ACCEPTED

input
0110110111

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 35

Subtask: 2

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 36

Subtask: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ

Test 37

Subtask: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ

Test 38

Subtask: 2

Verdict: ACCEPTED

input
110011001100110011001100110011...

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

user output
31
21 21 21 21 21 21 21 21 21 21 ...

Test 39

Subtask: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...

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

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 40

Subtask: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...

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

user output
23
23 22 20 17 15 15 15 15 14 13 ...

Test 41

Subtask: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Subtask: 3

Verdict: ACCEPTED

input
0100010110

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 43

Subtask: 3

Verdict: ACCEPTED

input
0100110110

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 44

Subtask: 3

Verdict: ACCEPTED

input
1110000001

correct output
2
2 1 

user output
2
2 1 

Test 45

Subtask: 3

Verdict: ACCEPTED

input
0001001110

correct output
3
2 2 1 

user output
3
2 2 1 

Test 46

Subtask: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

user output
3
3 1 1 

Test 47

Subtask: 3

Verdict: ACCEPTED

input
0100111100

correct output
3
1 1 1 

user output
3
1 1 1 

Test 48

Subtask: 3

Verdict: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
3
2 2 1 

Test 49

Subtask: 3

Verdict: ACCEPTED

input
0100100010

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 50

Subtask: 3

Verdict: ACCEPTED

input
1100101110

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 51

Subtask: 3

Verdict: ACCEPTED

input
1000111011

correct output
3
2 1 1 

user output
3
2 1 1 

Test 52

Subtask: 3

Verdict: ACCEPTED

input
1000111111

correct output
2
1 1 

user output
2
1 1 

Test 53

Subtask: 3

Verdict: ACCEPTED

input
0110011100

correct output
3
2 1 1 

user output
3
1 2 1 

Test 54

Subtask: 3

Verdict: ACCEPTED

input
0001000110

correct output
3
2 2 1 

user output
3
2 2 1 

Test 55

Subtask: 3

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 56

Subtask: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 57

Subtask: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 58

Subtask: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

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

user output
1501
1001 1001 1001 1001 1001 1001 ...

Test 59

Subtask: 3

Verdict: ACCEPTED

input
010101010101010101010101010101...

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

user output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 60

Subtask: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...

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

user output
1272
7 7 9 21 22 34 42 48 48 49 49 ...

Test 61

Subtask: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Subtask: 4

Verdict: ACCEPTED

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 63

Subtask: 4

Verdict: ACCEPTED

input
1101111101

correct output
3
2 2 1 

user output
3
2 2 1 

Test 64

Subtask: 4

Verdict: ACCEPTED

input
1001110001

correct output
3
2 1 1 

user output
3
3 1 1 

Test 65

Subtask: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1 

Test 66

Subtask: 4

Verdict: ACCEPTED

input
0100010111

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 67

Subtask: 4

Verdict: ACCEPTED

input
0100111010

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 68

Subtask: 4

Verdict: ACCEPTED

input
0010111101

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 69

Subtask: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
2
2 1 

Test 70

Subtask: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
QAQ

Test 71

Subtask: 4

Verdict: ACCEPTED

input
0110111000

correct output
3
2 1 1 

user output
3
1 2 1 

Test 72

Subtask: 4

Verdict: ACCEPTED

input
1100110111

correct output
3
3 2 1 

user output
3
3 2 1 

Test 73

Subtask: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
2
2 1 

Test 74

Subtask: 4

Verdict: ACCEPTED

input
1011000101

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 75

Subtask: 4

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 76

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Subtask: 4

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 79

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

Subtask: 4

Verdict:

input
111000110000011000001101010010...

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

user output
(empty)