CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:6502
Submission time:2015-09-30 13:40:45 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#10.15 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.06 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.06 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.06 s1details
#12ACCEPTED0.06 s1details
#13ACCEPTED0.05 s1details
#14ACCEPTED0.06 s1details
#15ACCEPTED0.06 s1details
#16ACCEPTED0.05 s1details
#170.14 s1details
#18ACCEPTED0.05 s1details
#19ACCEPTED0.05 s1details
#200.14 s1details
#210.14 s2details
#22ACCEPTED0.05 s2details
#23ACCEPTED0.06 s2details
#24ACCEPTED0.05 s2details
#25ACCEPTED0.05 s2details
#26ACCEPTED0.06 s2details
#27ACCEPTED0.05 s2details
#28ACCEPTED0.06 s2details
#29ACCEPTED0.07 s2details
#30ACCEPTED0.06 s2details
#31ACCEPTED0.06 s2details
#32ACCEPTED0.05 s2details
#33ACCEPTED0.06 s2details
#34ACCEPTED0.06 s2details
#35ACCEPTED0.06 s2details
#36--2details
#37--2details
#38--2details
#39ACCEPTED0.06 s2details
#40ACCEPTED0.06 s2details
#410.14 s3details
#42ACCEPTED0.05 s3details
#43ACCEPTED0.05 s3details
#44ACCEPTED0.06 s3details
#45ACCEPTED0.06 s3details
#46ACCEPTED0.04 s3details
#47ACCEPTED0.05 s3details
#48ACCEPTED0.05 s3details
#49ACCEPTED0.06 s3details
#50ACCEPTED0.06 s3details
#51ACCEPTED0.05 s3details
#52ACCEPTED0.05 s3details
#53ACCEPTED0.06 s3details
#54ACCEPTED0.05 s3details
#55ACCEPTED0.05 s3details
#56--3details
#57--3details
#58--3details
#59ACCEPTED0.16 s3details
#60ACCEPTED0.06 s3details
#610.13 s4details
#62ACCEPTED0.05 s4details
#63ACCEPTED0.06 s4details
#64ACCEPTED0.05 s4details
#65ACCEPTED0.05 s4details
#66ACCEPTED0.05 s4details
#67ACCEPTED0.06 s4details
#68ACCEPTED0.05 s4details
#69ACCEPTED0.07 s4details
#70ACCEPTED0.05 s4details
#71ACCEPTED0.06 s4details
#72ACCEPTED0.06 s4details
#73ACCEPTED0.05 s4details
#74ACCEPTED0.05 s4details
#75ACCEPTED0.06 s4details
#760.20 s4details
#770.20 s4details
#780.19 s4details
#790.20 s4details
#800.20 s4details

Code

#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) {
	vector<int> bits = *B;
	int t = 0, i = 0;
	unsigned e = 0;
	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;
	}
	for(vector<int>::iterator it = bits.begin(); it != bits.end(); ++it, ++it) {
		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);
			if (r < 0)
				return r;
			t = max(t, r);
		}
		e+=2;
	}
	trace.pop_back();
	return t+1;
}

int iterative(vector<int>* B, int depth) {
	int i = 0;
	unsigned int j = 0, bs = 0, pull = 0;
	vector<vector<int>> bitstream = vector<vector<int>>();
	vector<int> bits;
	bits = *B;
	vector<int> iteras = vector<int>();
	bitstream.push_back(bits);
	trace.push_back(0);
	iteras.push_back(0);
	while (bitstream.size() > 0) {
		if (pull) {
			/* printf("=== PULL:\n");
			for(vector<int>::iterator it = bits.begin(); it != bits.end(); ++it, ++it) {
				printf("%d %d\t",*it,*(it+1));
			} */
			trace.pop_back();
			iteras.pop_back();
			bitstream.pop_back();
			depth--;
		}
		i = trace.back();
		j = iteras.back();
		bits = bitstream.back();
		bs = bits.size();
		/* printf("\n");
		printf("j=%d\n",j);
		printf("bs=%d\n",bs);
		printf("===\n"); */
		if (bs < 1) {
			printf("%d\n",depth);
			i = 0;
			trace.pop_back();
			for(vector<int>::iterator it = trace.begin(); it != trace.end(); ++it) {
				if (i > 0) printf(" ");
				printf("%d",*it);
				i++;
			}
			printf("\n");
			return -1;
		}
		pull = 1;
		for(; j < bs; j+=2) {
			/* for(vector<int>::iterator it = bits.begin(); it != bits.end(); ++it, ++it) {
				printf("%d %d\t",*it,*(it+1));
			}
			printf("\nbs=%d, j=%d\nIT:\t",bs,j);
			for(vector<int>::iterator it = iteras.begin(); it != iteras.end(); ++it) {
				printf("%d\t",*it);
			}
			printf("\n"); */
			if (bits[j+1] > 1) {
				i++;
				vector<int> b(bits.begin(), bits.end());
				b.erase(b.begin()+j);
				b.erase(b.begin()+j);
				if (j > 0 && j < b.size()) {
					if (b[j-2] == b[j+0]) {
						b[j-1] += b[j+1];
						b.erase(b.begin()+j);
						b.erase(b.begin()+j);
					}
				}
				depth++;
				trace.pop_back();
				trace.push_back(i);
				trace.push_back(0);
				iteras.pop_back();
				iteras.push_back(j+2);
				iteras.push_back(0);
				bitstream.push_back(b);
				pull = 0;
				break;
			}
		}
	}
	return 0;
}

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 = '-';
	for (i = 0; i < l; i++) {
		if (i == 0 || lc != input[i]) {
			a.push_back((int)(input[i])-48);
			a.push_back(1);
		} else {
			a.back()++;
		}
		lc = input[i];
	}
	trace = vector<int>();
	if (iterative(&a,0) >= 0)
		printf("QAQ\n");
    return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1011001010

correct output
QAQ

user output
-1
2 1 1 1 0 1 1 1 0 0 49 0 8 6 4...

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
1 1 1

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

user output
4
1 1 1 1

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

correct output
4
2 1 1 1 

user output
4
1 2 1 1

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
1 1 1

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

correct output
3
1 2 1 

user output
3
1 2 1

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

correct output
2
1 1 

user output
2
1 1

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

correct output
3
2 1 1 

user output
4
1 1 1 1

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
1 1 1

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

user output
5
1 1 1 1 1

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

correct output
3
1 1 1 

user output
3
1 1 1

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
5
1 1 1 1 1

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
4
1 1 1 1

Test 17

Group: 1

Verdict:

input
1100101011

correct output
QAQ

user output
(empty)

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
4
1 1 1 1

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

correct output
3
2 1 1 

user output
3
2 1 1

Test 20

Group: 1

Verdict:

input
0000101000

correct output
QAQ

user output
(empty)

Test 21

Group: 2

Verdict:

input
1110010100

correct output
QAQ

user output
-1
3 2 1 0 0 0 33 0 27251504 0 0 ...

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000

correct output
3
2 1 1 

user output
3
2 1 1

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

correct output
4
1 1 1 1 

user output
4
1 1 1 1

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

correct output
2
1 1 

user output
2
1 1

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

correct output
2
2 1 

user output
2
2 1

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

correct output
3
2 1 1 

user output
3
1 2 1

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

correct output
3
2 1 1 

user output
3
2 1 1

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

correct output
3
3 2 1 

user output
3
3 2 1

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

correct output
4
1 1 1 1 

user output
4
1 1 1 1

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
1 1 1 1

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
3
1 1 1

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

correct output
4
1 1 1 1 

user output
4
1 1 1 1

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

correct output
4
2 1 1 1 

user output
4
1 2 1 1

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1

Test 36

Group: 2

Verdict:

input
110011001100110011001010101010...

correct output
QAQ

user output
(empty)

Test 37

Group: 2

Verdict:

input
110011001100110011001100101010...

correct output
QAQ

user output
(empty)

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 39

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

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...

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

user output
28
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 41

Group: 3

Verdict:

input
0010101000

correct output
QAQ

user output
(empty)

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

correct output
4
2 1 1 1 

user output
4
1 1 2 1

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

correct output
4
2 1 1 1 

user output
4
1 1 2 1

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

correct output
2
2 1 

user output
2
2 1

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

correct output
3
2 2 1 

user output
3
2 2 1

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

user output
4
1 1 1 1

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

correct output
3
1 1 1 

user output
3
1 1 1

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
4
1 1 1 1

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

correct output
4
2 1 1 1 

user output
4
1 2 1 1

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

correct output
3
2 1 1 

user output
3
2 1 1

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

correct output
2
1 1 

user output
2
1 1

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

correct output
3
2 1 1 

user output
4
1 1 1 1

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

correct output
3
2 2 1 

user output
3
2 2 1

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1

Test 56

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 57

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 59

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

Group: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...

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

user output
1690
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 61

Group: 4

Verdict:

input
1110101110

correct output
QAQ

user output
(empty)

Error:
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

correct output
3
2 2 1 

user output
3
2 2 1

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

correct output
3
2 1 1 

user output
3
1 2 1

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

correct output
4
1 1 1 1 

user output
4
1 1 1 1

Test 67

Group: 4

Verdict: ACCEPTED

input
0100111010

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

correct output
4
1 1 1 1 

user output
4
1 1 1 1

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
3
1 1 1

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

correct output
4
2 2 2 1 

user output
4
2 2 2 1

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

correct output
3
2 1 1 

user output
4
1 1 1 1

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

correct output
3
3 2 1 

user output
4
1 2 1 1

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
3
1 1 1

Test 74

Group: 4

Verdict: ACCEPTED

input
1011000101

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 79

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

Group: 4

Verdict:

input
111000110000011000001101010010...

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

user output
(empty)