Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-10-08 15:08:3311
2015-10-08 15:04:020
2015-10-08 15:03:170
2015-10-01 13:31:0111
Task:Bittipeli
Sender:Pietu1998
Submission time:2015-10-08 15:08:33
Language:C++
Status:READY
Score:11

Feedback

groupverdictscore
#1ACCEPTED11
#2TIME LIMIT EXCEEDED0
#3TIME LIMIT EXCEEDED0
#4TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.05 / 1.001details
#2ACCEPTED0.05 / 1.001details
#3ACCEPTED0.05 / 1.001details
#4ACCEPTED0.05 / 1.001details
#5ACCEPTED0.06 / 1.001details
#6ACCEPTED0.06 / 1.001details
#7ACCEPTED0.05 / 1.001details
#8ACCEPTED0.05 / 1.001details
#9ACCEPTED0.06 / 1.001details
#10ACCEPTED0.06 / 1.001details
#11ACCEPTED0.07 / 1.001details
#12ACCEPTED0.06 / 1.001details
#13ACCEPTED0.06 / 1.001details
#14ACCEPTED0.06 / 1.001details
#15ACCEPTED0.06 / 1.001details
#16ACCEPTED0.06 / 1.001details
#17ACCEPTED0.05 / 1.001details
#18ACCEPTED0.05 / 1.001details
#19ACCEPTED0.05 / 1.001details
#20ACCEPTED0.06 / 1.001details
#21ACCEPTED0.05 / 1.002details
#22ACCEPTED0.06 / 1.002details
#23ACCEPTED0.06 / 1.002details
#24ACCEPTED0.06 / 1.002details
#25ACCEPTED0.05 / 1.002details
#26ACCEPTED0.06 / 1.002details
#27ACCEPTED0.06 / 1.002details
#28ACCEPTED0.06 / 1.002details
#29ACCEPTED0.05 / 1.002details
#30ACCEPTED0.06 / 1.002details
#31ACCEPTED0.07 / 1.002details
#32ACCEPTED0.06 / 1.002details
#33ACCEPTED0.05 / 1.002details
#34ACCEPTED0.06 / 1.002details
#35ACCEPTED0.06 / 1.002details
#36TIME LIMIT EXCEEDED-- / 1.002details
#37TIME LIMIT EXCEEDED-- / 1.002details
#38ACCEPTED0.06 / 1.002details
#39ACCEPTED0.06 / 1.002details
#40ACCEPTED0.06 / 1.002details
#41ACCEPTED0.06 / 1.003details
#42ACCEPTED0.05 / 1.003details
#43ACCEPTED0.06 / 1.003details
#44ACCEPTED0.05 / 1.003details
#45ACCEPTED0.06 / 1.003details
#46ACCEPTED0.06 / 1.003details
#47ACCEPTED0.06 / 1.003details
#48ACCEPTED0.06 / 1.003details
#49ACCEPTED0.06 / 1.003details
#50ACCEPTED0.06 / 1.003details
#51ACCEPTED0.05 / 1.003details
#52ACCEPTED0.05 / 1.003details
#53ACCEPTED0.06 / 1.003details
#54ACCEPTED0.05 / 1.003details
#55ACCEPTED0.06 / 1.003details
#56TIME LIMIT EXCEEDED-- / 1.003details
#57TIME LIMIT EXCEEDED-- / 1.003details
#58ACCEPTED0.06 / 1.003details
#59ACCEPTED0.06 / 1.003details
#60ACCEPTED0.05 / 1.003details
#61ACCEPTED0.06 / 1.004details
#62ACCEPTED0.05 / 1.004details
#63ACCEPTED0.06 / 1.004details
#64ACCEPTED0.06 / 1.004details
#65ACCEPTED0.05 / 1.004details
#66ACCEPTED0.04 / 1.004details
#67ACCEPTED0.08 / 1.004details
#68ACCEPTED0.05 / 1.004details
#69ACCEPTED0.06 / 1.004details
#70ACCEPTED0.05 / 1.004details
#71ACCEPTED0.06 / 1.004details
#72ACCEPTED0.06 / 1.004details
#73ACCEPTED0.06 / 1.004details
#74ACCEPTED0.06 / 1.004details
#75ACCEPTED0.05 / 1.004details
#76TIME LIMIT EXCEEDED-- / 1.004details
#77TIME LIMIT EXCEEDED-- / 1.004details
#78ACCEPTED0.53 / 1.004details
#79TIME LIMIT EXCEEDED-- / 1.004details
#80ACCEPTED0.06 / 1.004details

Code

#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 details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

view   save

correct output
3
1 1 1 

view   save

user output
3
2 1 1 

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1 

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

view   save

correct output
3
1 1 1 

view   save

user output
3
2 1 1 

view   save

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

view   save

correct output
3
1 2 1 

view   save

user output
3
3 1 1 

view   save

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1 

view   save

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

view   save

correct output
3
1 1 1 

view   save

user output
3
2 1 1 

view   save

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

view   save

correct output
4
1 2 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

view   save

correct output
4
2 2 2 1 

view   save

user output
4
2 2 2 1 

view   save

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
3 2 1 1 

view   save

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

view   save

correct output
3
3 2 1 

view   save

user output
3
2 2 1 

view   save

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1 

view   save

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

view   save

correct output
3
3 2 1 

view   save

user output
3
3 2 1 

view   save

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
3 2 1 1 

view   save

Test 36

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001010101010...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 37

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100101010...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 38

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
31
1 20 20 20 20 20 20 20 20 20 2...
view   save

user output
31
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
view   save

Test 39

Group: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...
view   save

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

user output
23
1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
view   save

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 1 2 1 

view   save

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 1 2 1 

view   save

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

view   save

correct output
3
1 2 1 

view   save

user output
3
2 1 1 

view   save

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1 

view   save

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
3 2 1 1 

view   save

Test 56

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 57

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 58

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
1501
1 1000 1000 1000 1000 1000 100...
view   save

user output
1501
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
view   save

Test 59

Group: 3

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 60

Group: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...
view   save

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

user output
1272
1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
view   save

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1 

view   save

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 67

Group: 4

Verdict: ACCEPTED

input
0100111010

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

view   save

correct output
4
1 1 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

view   save

correct output
4
2 2 2 1 

view   save

user output
4
2 2 2 1 

view   save

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1 

view   save

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

view   save

correct output
3
3 2 1 

view   save

user output
3
3 2 1 

view   save

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 74

Group: 4

Verdict: ACCEPTED

input
1011000101

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
3 2 1 1 

view   save

Test 76

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 77

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 78

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
30001
1 20000 20000 20000 20000 2000...
view   save

user output
30001
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
view   save

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
010101010101010101010101010101...
view   save

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
(empty)

Test 80

Group: 4

Verdict: ACCEPTED

input
111000110000011000001101010010...
view   save

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

user output
25011
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
view   save