Bittipeli

#include <string.h>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define ull unsigned long long

vector<int> trace;

int recursive(vector<int>* B, int depth, int rev) {
	vector<int> bits = *B;
	int t = 0, i = 0;
	unsigned e = 0;
	/* printf("SZ=%d\n",B->size());
 	for(vector<int>::iterator it = bits.begin(); it != bits.end(); ++it, ++it) {
		int x = *(it);
		int y = *(it + 1);
		printf("%d %d\n",x,y);
	}  */
	if (B->size() < 1) {
		printf("%d\n",depth);
		for(vector<int>::iterator it = trace.begin(); it != trace.end(); ++it) {
			if (i > 0)
				printf(" ");
			printf("%d",*it);
			i++;
		}
		printf("\n");
		return -1;
	}
	if (rev) {
		for(vector<int>::reverse_iterator it = bits.rbegin(); it != bits.rend(); ++it, ++it) {
			/* printf("%d\n",e); */
			if (*(it + 1) > 1) {
				i++;
				vector<int> b(bits.begin(), bits.end());
				b.erase(b.begin()+e,b.begin()+(e+2));
				if (e > 0 && e < b.size()) {
					if (b[e-2] == b[e+0]) {
						b[e-1] += b[e+1];
						b.erase(b.begin()+e,b.begin()+(e+2));
					}
				}
				trace.push_back(i);
				int r = recursive(&b, depth + 1, rev);
				if (r < 0)
					return r;
				t = max(t, r);
			}
			e+=2;
		}
	} else {
		for(vector<int>::iterator it = bits.begin(); it != bits.end(); ++it, ++it) {
			/* printf("%d\n",e); */
			if (*(it + 1) > 1) {
				i++;
				vector<int> b(bits.begin(), bits.end());
				b.erase(b.begin()+e,b.begin()+(e+2));
				if (e > 0 && e < b.size()) {
					if (b[e-2] == b[e+0]) {
						b[e-1] += b[e+1];
						b.erase(b.begin()+e,b.begin()+(e+2));
					}
				}
				trace.push_back(i);
				int r = recursive(&b, depth + 1, rev);
				if (r < 0)
					return r;
				t = max(t, r);
			}
			e+=2;
		}
	}
	trace.pop_back();
	return t+1;
}

int main() {
    cin.sync_with_stdio(false);
    char input[100000];
    cin >> input;
	int l = strlen(input);
	vector<int> a = vector<int>();
	int i;
	char lc = '-';
	int lim = l >> 1;
	unsigned hal = 0;
	for (i = 0; i < l; i++) {
		if (i == 0 || lc != input[i]) {
			a.push_back((int)(input[i])-48);
			a.push_back(1);
			if (i < lim) {
				hal+=2;
			}
		} else {
			a.back()++;
		}
		lc = input[i];
	}
	trace = vector<int>();
	if (recursive(&a,0,hal>(a.size()>>1)) >= 0)
		printf("QAQ\n");
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: WRONG ANSWER

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: WRONG ANSWER

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: WRONG ANSWER

Test 14

Group: 1

Verdict: WRONG ANSWER

Test 15

Group: 1

Verdict: ACCEPTED

Test 16

Group: 1

Verdict: WRONG ANSWER

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 1

Verdict: WRONG ANSWER

Test 19

Group: 1

Verdict: WRONG ANSWER

Test 20

Group: 1

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: WRONG ANSWER

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: ACCEPTED

Test 30

Group: 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: WRONG ANSWER

Test 32

Group: 2

Verdict: WRONG ANSWER

Test 33

Group: 2

Verdict: ACCEPTED

Test 34

Group: 2

Verdict: WRONG ANSWER

Test 35

Group: 2

Verdict: ACCEPTED

Test 36

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 37

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 38

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 39

Group: 2

Verdict: ACCEPTED

Test 40

Group: 2

Verdict: WRONG ANSWER

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: ACCEPTED

Test 43

Group: 3

Verdict: WRONG ANSWER

Test 44

Group: 3

Verdict: WRONG ANSWER

Test 45

Group: 3

Verdict: WRONG ANSWER

Test 46

Group: 3

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: WRONG ANSWER

Test 48

Group: 3

Verdict: WRONG ANSWER

Test 49

Group: 3

Verdict: WRONG ANSWER

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: WRONG ANSWER

Test 52

Group: 3

Verdict: WRONG ANSWER

Test 53

Group: 3

Verdict: WRONG ANSWER

Test 54

Group: 3

Verdict: WRONG ANSWER

Test 55

Group: 3

Verdict: ACCEPTED

Test 56

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 57

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 58

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 59

Group: 3

Verdict: ACCEPTED

Test 60

Group: 3

Verdict: ACCEPTED

Test 61

Group: 4

Verdict: ACCEPTED

Test 62

Group: 4

Verdict: ACCEPTED

Test 63

Group: 4

Verdict: WRONG ANSWER

Test 64

Group: 4

Verdict: WRONG ANSWER

Test 65

Group: 4

Verdict: WRONG ANSWER

Test 66

Group: 4

Verdict: ACCEPTED

Test 67

Group: 4

Verdict: WRONG ANSWER

Test 68

Group: 4

Verdict: WRONG ANSWER

Test 69

Group: 4

Verdict: WRONG ANSWER

Test 70

Group: 4

Verdict: WRONG ANSWER

Test 71

Group: 4

Verdict: WRONG ANSWER

Test 72

Group: 4

Verdict: WRONG ANSWER

Test 73

Group: 4

Verdict: WRONG ANSWER

Test 74

Group: 4

Verdict: WRONG ANSWER

Test 75

Group: 4

Verdict: ACCEPTED

Test 76

Group: 4

Verdict: RUNTIME ERROR

Test 77

Group: 4

Verdict: RUNTIME ERROR

Test 78

Group: 4

Verdict: RUNTIME ERROR

Test 79

Group: 4

Verdict: RUNTIME ERROR

Test 80

Group: 4

Verdict: WRONG ANSWER