Bittipeli

#include <iostream>
#include <list>
#include <forward_list>
#include <string>
#include <vector>

using namespace std;

static forward_list<bool> ll;
static size_t totalsize = 0;

vector<int>* solve (int numofremoable) {
  /*for ( auto it = ll.begin() ; it != ll.end() ; ++it) {
    cout << *it;
  }
  cout << endl;*/

  vector<int>* result(nullptr);
  if (numofremoable == 0) {
    size_t len = distance(ll.begin(), ll.end());
    //cout << "len: " << len << endl;
    result = new vector<int>();
    result->reserve(totalsize/2+2);
    while (len > 2) {
      result->push_back(2);
      len = len - 2;
    }
    for(size_t i = 0; i < len; ++i) {
      result->push_back(2);
      result->at(i) = 1;
    }
    return result;
  }

  auto nextit = ll.begin();
  auto previt = nextit++;
  auto curit = nextit++;
  int place = 0;
  if (*previt) {
    ++place;
  }

  while (nextit != ll.end()) {
    if (*curit) {
      place++;
      if ( !*nextit && !*previt) {
        forward_list<bool> store;
        ++nextit;
        store.splice_after(store.before_begin(), ll, previt, nextit);
        *previt = true;
        result = solve(numofremoable - 2);
        if ( result != nullptr) {
          result->push_back(place);
          return result;
        }
        ll.splice_after(previt, store);
        *previt = false;
      }
    }
    ++previt;
    ++curit;
    nextit = curit;
    ++nextit;
  }

  nextit = ll.begin();
  previt = nextit++;
  curit = nextit++;
  place = 0;
  if (*previt) {
    ++place;
  }

  while (nextit != ll.end()) {
    if (*curit) {
      place++;
      if (*nextit != *previt) {
        forward_list<bool> store;
        ++nextit;
        store.splice_after(store.before_begin(), ll, previt, nextit);
        bool sb = *previt;
        *previt = true;
        result = solve(numofremoable - 1);
        if ( result != nullptr) {
          result->push_back(place);
          return result;
        }
        ll.splice_after(previt, store);
        *previt = sb;
      }
    }
    ++previt;
    ++curit;
    nextit = curit;
    ++nextit;
  }

  return nullptr;
}


int main () {
  char curchar(0);
  char readchar(0);
  int numofremoable(0);

  cin >> curchar;
  bool remoable = false;

  auto cur = ll.before_begin();


  while (cin >> readchar) {
    if (curchar == readchar) {
      remoable = true;

    } else {
      //cout << remoable << " ";
      cur = ll.insert_after(cur,remoable);
      ++totalsize;
      if (!remoable) ++numofremoable;
      curchar = readchar;
      remoable = false;
    }
  }

  cur = ll.insert_after(cur,remoable);
  ++totalsize;
  if (!remoable) ++numofremoable;
  //cout << remoable << endl;

  //cout << numofremoable << " of " << totalsize << endl;

  vector<int>* result = solve(numofremoable);

  if (result == nullptr) {
    cout << "QAQ" << endl;
  } else {
    size_t len = result->size();
    cout << len << endl;
    for (size_t i = len-1 ; i > 0 ; --i) {
      cout << result->at(i) << " ";
    }
    cout << result->at(0) << endl;
  }

  // os take care memory releases
  return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 1

Verdict: ACCEPTED

Test 16

Group: 1

Verdict: ACCEPTED

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 1

Verdict: ACCEPTED

Test 19

Group: 1

Verdict: ACCEPTED

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

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

Test 32

Group: 2

Verdict: ACCEPTED

Test 33

Group: 2

Verdict: ACCEPTED

Test 34

Group: 2

Verdict: ACCEPTED

Test 35

Group: 2

Verdict: ACCEPTED

Test 36

Group: 2

Verdict: ACCEPTED

Test 37

Group: 2

Verdict: ACCEPTED

Test 38

Group: 2

Verdict: ACCEPTED

Test 39

Group: 2

Verdict: ACCEPTED

Test 40

Group: 2

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: ACCEPTED

Test 43

Group: 3

Verdict: ACCEPTED

Test 44

Group: 3

Verdict: ACCEPTED

Test 45

Group: 3

Verdict: ACCEPTED

Test 46

Group: 3

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: ACCEPTED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: ACCEPTED

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: ACCEPTED

Test 52

Group: 3

Verdict: ACCEPTED

Test 53

Group: 3

Verdict: ACCEPTED

Test 54

Group: 3

Verdict: ACCEPTED

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

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

Test 64

Group: 4

Verdict: ACCEPTED

Test 65

Group: 4

Verdict: ACCEPTED

Test 66

Group: 4

Verdict: ACCEPTED

Test 67

Group: 4

Verdict: ACCEPTED

Test 68

Group: 4

Verdict: ACCEPTED

Test 69

Group: 4

Verdict: ACCEPTED

Test 70

Group: 4

Verdict: ACCEPTED

Test 71

Group: 4

Verdict: ACCEPTED

Test 72

Group: 4

Verdict: ACCEPTED

Test 73

Group: 4

Verdict: ACCEPTED

Test 74

Group: 4

Verdict: ACCEPTED

Test 75

Group: 4

Verdict: ACCEPTED

Test 76

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 77

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 78

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 80

Group: 4

Verdict: TIME LIMIT EXCEEDED