CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:juhoh
Submission time:2015-09-29 23:23:53 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.06 s1details
#50.05 s1details
#6ACCEPTED0.05 s1details
#70.05 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.06 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.06 s1details
#120.05 s1details
#13ACCEPTED0.05 s1details
#14ACCEPTED0.05 s1details
#150.05 s1details
#16ACCEPTED0.05 s1details
#17ACCEPTED0.06 s1details
#18ACCEPTED0.06 s1details
#19ACCEPTED0.05 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.06 s2details
#22ACCEPTED0.06 s2details
#230.05 s2details
#24ACCEPTED0.06 s2details
#25ACCEPTED0.06 s2details
#260.05 s2details
#27ACCEPTED0.06 s2details
#28ACCEPTED0.05 s2details
#29ACCEPTED0.06 s2details
#30ACCEPTED0.05 s2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.05 s2details
#33ACCEPTED0.05 s2details
#34ACCEPTED0.06 s2details
#350.05 s2details
#36ACCEPTED0.05 s2details
#37ACCEPTED0.05 s2details
#380.05 s2details
#39ACCEPTED0.05 s2details
#40ACCEPTED0.05 s2details
#41ACCEPTED0.05 s3details
#420.05 s3details
#43ACCEPTED0.05 s3details
#44ACCEPTED0.05 s3details
#45ACCEPTED0.05 s3details
#46ACCEPTED0.05 s3details
#47ACCEPTED0.05 s3details
#48ACCEPTED0.05 s3details
#49ACCEPTED0.05 s3details
#500.05 s3details
#51ACCEPTED0.05 s3details
#52ACCEPTED0.04 s3details
#53ACCEPTED0.06 s3details
#54ACCEPTED0.06 s3details
#550.05 s3details
#56ACCEPTED0.05 s3details
#57ACCEPTED0.06 s3details
#58--3details
#59--3details
#60--3details
#61ACCEPTED0.06 s4details
#620.06 s4details
#63ACCEPTED0.06 s4details
#64ACCEPTED0.05 s4details
#65ACCEPTED0.06 s4details
#660.05 s4details
#67ACCEPTED0.05 s4details
#68ACCEPTED0.05 s4details
#69ACCEPTED0.06 s4details
#70ACCEPTED0.06 s4details
#71ACCEPTED0.06 s4details
#72ACCEPTED0.06 s4details
#73ACCEPTED0.06 s4details
#74ACCEPTED0.06 s4details
#750.05 s4details
#76--4details
#77--4details
#78--4details
#79--4details
#80--4details

Code

#include <iostream>
#include <algorithm>
#include <cstring>

typedef long long int ll;

using namespace std;

int state  [100000] = {0};
int checked[100000] = {0};
int conv   [100000] = {0};
int moves  [100000] = {0};
int numMoves = 0;
int n;
int qaq = 0;

int nextMove() {
    if (n == 0) {
        return 0;
    } else if (n == 1) {
        if (state[0] > 1) {
            moves[numMoves] = 1;
            ++numMoves;
        } else {
            cout << "QAQ" << endl;
            qaq = 1;
        }
        return 0;
    }
    checked[0] = state[0] > 1;
    checked[n-1] = state[n-1] > 1;
    for (int i = 1; i < n-1; ++i) {
        if (state[i] > 1) {
            checked[i] = min(i,n-1-i) + 1;
        } else {
            checked[i] = 0;
        }
    }

    int m = 0;
    int l = 0;
    int o = 1;
    for (int i = 0; i < n; ++i) {
        if (checked[i] > m) {
            l = i;
            m = checked[i];
        }
        if (state[i] > 1) {
            conv[i] = o;
            ++o;
        } else {
            conv[i] = 0;
        }
    }

    for (int j = 0; j < m; ++j) {
        checked[0] = max(checked[0], checked[1]-1);
        checked[n-1] = max(checked[n-1], checked[n-2]-1);
        for (int i = 1; i < n-1; ++i) {
            checked[i] = max(max(checked[i], checked[i+1]-1), checked[i-1]-1);
        }
    }

    for (int i = 0; i < n; ++i) {
        if (checked[i] == 0) {
            cout << "QAQ" << endl;
            qaq = 1;
            return 0;
        }
    }

    if (l == 0) {
        memmove(state, state + 1, n - 1);
        --n;
    } else if (l == n - 1) {
        --n;
    } else {
        state[l-1] += state[l+1];
        memmove(state+l, state+l+2, n-l-2);
        n-=2;
    }

    moves[numMoves] = conv[l];
    ++numMoves;

    return 1;
}

int main() {

    string input;
    cin >> input;
    n = input.length();
    int last = input[0] == '1';
    size_t i = 0;
    int j = 0;
    while (i < input.length()) {
        int c = input[i] == '1';
        if (c != last) {
            ++j;
            last = c;
        }
        ++state[j];
        ++i;
    }
    n=j+1;

    while (nextMove()) {}

    if (!qaq) {
        cout << numMoves << endl;
        for (int i = 0; i < numMoves; ++i) {
            cout << moves[i] << " ";
        }
        cout << endl;
    }

    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
2 1 1 

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

user output
3
1 2 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:

input
1110010110

correct output
4
2 1 1 1 

user output
QAQ

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
2 1 1 

Test 7

Group: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
QAQ

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
3
1 2 1 

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
2 1 1 

Test 12

Group: 1

Verdict:

input
1101101100

correct output
4
1 2 1 1 

user output
QAQ

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
4
2 2 2 1 

Test 15

Group: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
4
2 2 1 1 

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
3
2 2 1 

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
3
2 2 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: ACCEPTED

input
0000101000

correct output
QAQ

user output
QAQ

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

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:

input
1001101100

correct output
4
1 1 1 1 

user output
QAQ

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:

input
1100101100

correct output
4
2 1 1 1 

user output
QAQ

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
2 2 1 1 

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
2
2 1 

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 35

Group: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
4
2 2 1 1 

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

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

user output
QAQ

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
23
12 12 11 12 11 11 11 10 9 9 9 ...

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Group: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
QAQ

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

correct output
4
2 1 1 1 

user output
4
2 1 1 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
3
2 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
3
2 2 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:

input
1100101110

correct output
4
2 1 1 1 

user output
QAQ

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
3
2 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:

input
1110110010

correct output
4
1 2 1 1 

user output
4
2 2 1 1 

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

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:

input
010101010101010101010101010101...

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

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

user output
(empty)

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Group: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
QAQ

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
2 1 1 

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1 

Test 66

Group: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
QAQ

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
2 2 1 1 

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
2
2 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
3
1 2 1 

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

correct output
3
3 2 1 

user output
3
3 2 1 

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
2
2 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:

input
1110110010

correct output
4
1 2 1 1 

user output
4
2 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)