Bittipeli

#include <iostream>
#include <list>
#include <algorithm>
#include <vector>
 
using namespace std;
 
struct node
{
	pair<int,char> v;
	int i;
	node *p;
	node *n;
	node():v(make_pair(0,0)),i(-1),p(NULL),n(NULL){}
	node(pair<int,char> nv,int ni):v(nv),i(ni),p(NULL),n(NULL){}
};
 
typedef vector<node> lista;
 
vector<int> *ratkaise(lista &l,const int J,const int N,int taso)
{
	/*for(int _=0;_<taso;_++)cout<<"  ";
	cout<<"level "<<taso<<" with "<<J<<" ";
	for(node *i=&l[0];i!=NULL;i=i->n)
		for(int j=0;j<i->v.first;j++)
			cout<<i->v.second;
	cout<<" from "<<&l[0]<<endl;*/
	vector<int> *r;
	switch(J)
	{
	case 0:
		return new vector<int>;
	case 1:
		if(l[N-1].v.first<=1) return NULL;
		r=new vector<int>;
		r->push_back(1);
		return r;
	case 2:
		if(l[0].v.first<=1||l[N-1].v.first<=1) return NULL;
		r=new vector<int>;
		r->push_back(1);
		r->push_back(1);
		return r;
	default:
		break;
	}
	int q = 1;
	if(l[0].v.first>1) q++;
	lista d;
	for (node *i=l[0].n;i->n!=NULL;i=i->n) {
		pair<int,char> a=i->v;
		if (a.first>1) {
			node *p=i->p;
			node *n=i->n;
			if(n->n==NULL){
				if(p->p==NULL){
					r=new vector<int>;
					r->push_back(1);
					r->push_back(q);
					return r;
				}else{
					/*for(int j=0;j<taso*2+1;j++)cout<<" ";
					cout<<"merge forward to "<<n<<endl;*/
					pair<int,char> na=n->v;
					node *pp=p->p;
					pp->n=n;
					n->v=make_pair(na.first+p->v.first,na.second);
					n->p=pp;
					if((r=ratkaise(l,J-2,N,taso+1))!=NULL){
						r->push_back(q);
						return r;
					}
					n->p=i;
					n->v=na;
					pp->n=p;
				}
			}else{
				/*for(int j=0;j<taso*2+1;j++)cout<<" ";
				cout<<"merge backward to "<<p<<endl;*/
				pair<int,char> pa=p->v;
				node *nn=n->n;
				nn->p=p;
				p->v=make_pair(pa.first+n->v.first,pa.second);
				p->n=nn;
				if((r=ratkaise(l,J-2,N,taso+1))!=NULL){
					r->push_back(q);
					return r;
				}
				p->n=i;
				p->v=pa;
				nn->p=n;
			}
			q++;
		}//else{for(int j=0;j<taso*2+1;j++)cout<<" ";cout<<"too short"<<endl;}
	}
	return NULL;
}
 
int main()
{
	cin.sync_with_stdio(false);
	
	string s;
	cin>>s;
	char p=s[0];
	int m=0,k=1;
	lista l;
	for (unsigned i=1;i<s.length();i++)
	{
		if (s[i]!=p)
		{
			l.push_back(node(make_pair(k,p),m));
			p=s[i];
			k=0;
			m++;
		}
		k++;
	}
	l.push_back(node(make_pair(k,p),m));
	m++;
	for (int i=1;i<m;i++)
	{
		l[i-1].n=&l[i];
		l[i].p=&l[i-1];
	}
	/*for (int i=0;i<m;i++)
	{
		node j=l[i];
		cout<<"item "<<i<<" at "<<&l[i]<<": "<<j.v.first<<" of "<<j.v.second;
		if(j.p!=NULL)cout<<" prev "<<j.p;
		if(j.n!=NULL)cout<<" next "<<j.n;
		cout<<endl;
	}*/
	vector<int> *r=ratkaise(l,m,m,0);
	/*for (int i=0;i<m;i++)
	{
		node j=l[i];
		cout<<"item "<<i<<" at "<<&l[i]<<": "<<j.v.first<<" of "<<j.v.second;
		if(j.p!=NULL)cout<<" prev "<<j.p;
		if(j.n!=NULL)cout<<" next "<<j.n;
		cout<<endl;
	}*/
	if (r==NULL)
		cout<<"QAQ";
	else
	{
		cout<<r->size()<<endl;
		for(vector<int>::reverse_iterator i=r->rbegin();i!=r->rend();i++)cout<<*i<<" ";
	}
	cout<<endl;
	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: TIME LIMIT EXCEEDED

Test 37

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 80

Group: 4

Verdict: ACCEPTED