Submission details
Task:Bittipeli
Sender:Dentosal
Submission time:2015-10-09 21:05:35 +0300
Language:C++
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
Test results
testverdicttimesubtask
#1ACCEPTED0.05 s1details
#20.05 s1details
#30.05 s1details
#40.05 s1details
#50.06 s1details
#60.06 s1details
#70.06 s1details
#80.05 s1details
#90.06 s1details
#100.05 s1details
#110.09 s1details
#120.05 s1details
#130.06 s1details
#140.05 s1details
#150.05 s1details
#160.05 s1details
#17ACCEPTED0.05 s1details
#180.05 s1details
#190.05 s1details
#20ACCEPTED0.06 s1details
#21ACCEPTED0.06 s2details
#220.05 s2details
#230.05 s2details
#240.05 s2details
#250.05 s2details
#260.05 s2details
#270.05 s2details
#280.05 s2details
#290.06 s2details
#300.06 s2details
#310.06 s2details
#320.05 s2details
#330.05 s2details
#340.06 s2details
#350.06 s2details
#36ACCEPTED0.06 s2details
#37ACCEPTED0.17 s2details
#380.28 s2details
#390.05 s2details
#400.05 s2details
#41ACCEPTED0.06 s3details
#420.05 s3details
#430.06 s3details
#440.06 s3details
#450.06 s3details
#460.05 s3details
#470.05 s3details
#480.05 s3details
#490.06 s3details
#500.05 s3details
#510.05 s3details
#520.06 s3details
#530.06 s3details
#540.06 s3details
#550.06 s3details
#56--3details
#57--3details
#58--3details
#590.07 s3details
#600.06 s3details
#61ACCEPTED0.05 s4details
#620.05 s4details
#630.05 s4details
#640.05 s4details
#650.05 s4details
#660.05 s4details
#670.22 s4details
#680.06 s4details
#690.06 s4details
#700.05 s4details
#710.05 s4details
#720.06 s4details
#730.05 s4details
#740.05 s4details
#750.05 s4details
#760.16 s4details
#770.10 s4details
#780.15 s4details
#79--4details
#800.11 s4details

Compiler report

input/code.cpp: In function 'void rm1(std::vector<long long int>&, ll)':
input/code.cpp:13:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     else if (i==g.size()-1) {
               ^
input/code.cpp: In function 'std::vector<long long int> solve(std::vector<long long int>)':
input/code.cpp:44:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (ll i = 0; i < tmpp.first.size(); i++) {
                          ^
input/code.cpp: In function 'int main()':
input/code.cpp:63:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (ll i = 1; i < inps.length(); i++) {
                      ^
input/code.cpp:75:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (ll i = 0; i < r.size(); i++) {
                          ^

Code

#include <iostream>
#include <string>
#include <vector>
#include <utility>

typedef long long ll;
using namespace std;

inline void rm1(std::vector<ll> &g, ll i) {
    if (i==0) {
        g.erase(g.begin());
    }
    else if (i==g.size()-1) {
        g.erase(g.begin()+g.size()-1);
    }
    else {
        ll a = g[i-1] + g[i+1];
        g.erase(g.begin()+i);
        g.erase(g.begin()+i);
        g[i-1] = a;
    }
}

std::vector<ll> solve(std::vector<ll> grps) {
    std::vector< std::pair< std::vector<ll>,std::vector<ll> > > alt;
    std::vector<ll> res;
    std::vector<ll> empty;
    std::pair< std::vector<ll>,std::vector<ll> > ptmp = make_pair(grps, empty);
    alt.push_back(ptmp);
    ll c;
    while (alt.size()) {
        std::pair< std::vector<ll>,std::vector<ll> > tmpp = alt.back();
        alt.pop_back();
        if (tmpp.first.size() == 0) {
            res = tmpp.second;
            break;
        }
        if (tmpp.first.size() == 1 && tmpp.first[0] != 1) {
            res = tmpp.second;
            res.push_back(1);
            break;
        }
        c = 0;
        for (ll i = 0; i < tmpp.first.size(); i++) {
            if (tmpp.first[i] == 1) {
                continue;
            }
            c++;
            rm1(tmpp.first, i);
            tmpp.second.push_back(c);
            alt.push_back(make_pair(tmpp.first, tmpp.second));
        }
    }
    return res;
}

int main() {
    string inps;
    cin >> inps;

    std::vector<ll> grps;
    grps.push_back(1);
    for (ll i = 1; i < inps.length(); i++) {
        if (inps[i] != inps[i-1]) {
            grps.push_back(0);
        }
        grps[grps.size()-1] += 1;
    }

    std::vector<ll> r = solve(grps);
    if (r.size() == 0) {
        std::cout << "QAQ" << std::endl;
    }
    else {
        for (ll i = 0; i < r.size(); i++) {
            std::cout << r[i] << " ";
        }
        std::cout << std::endl;
    }

    return 0;
}

Test details

Test 1

Subtask: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Subtask: 1

Verdict:

input
0000001001

correct output
3
1 1 1 

user output
1 2 1 

Test 3

Subtask: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
1 2 1 1 

Test 4

Subtask: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
QAQ

Test 5

Subtask: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
QAQ

Test 6

Subtask: 1

Verdict:

input
1111110110

correct output
3
1 1 1 

user output
1 2 1 

Test 7

Subtask: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
1 2 1 

Test 8

Subtask: 1

Verdict:

input
0111111000

correct output
2
1 1 

user output
1 1 

Test 9

Subtask: 1

Verdict:

input
1111111100

correct output
2
1 1 

user output
1 1 

Test 10

Subtask: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
1 2 1 1 

Test 11

Subtask: 1

Verdict:

input
1101110000

correct output
3
1 1 1 

user output
1 2 1 

Test 12

Subtask: 1

Verdict:

input
1101101100

correct output
4
1 2 1 1 

user output
1 2 3 1 1 

Test 13

Subtask: 1

Verdict:

input
0100111110

correct output
3
1 1 1 

user output
1 1 1 

Test 14

Subtask: 1

Verdict:

input
1101001011

correct output
4
2 2 2 1 

user output
1 2 3 1 1 

Test 15

Subtask: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

Test 16

Subtask: 1

Verdict:

input
0011011100

correct output
3
3 2 1 

user output
1 2 1 1 

Test 17

Subtask: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Subtask: 1

Verdict:

input
1101100111

correct output
3
2 2 1 

user output
1 2 1 1 

Test 19

Subtask: 1

Verdict:

input
0110000100

correct output
3
2 1 1 

user output
QAQ

Test 20

Subtask: 1

Verdict: ACCEPTED

input
0000101000

correct output
QAQ

user output
QAQ

Test 21

Subtask: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

Test 22

Subtask: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
QAQ

Test 23

Subtask: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
1 2 1 1 

Test 24

Subtask: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
1 1 

Test 25

Subtask: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
QAQ

Test 26

Subtask: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
QAQ

Test 27

Subtask: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
QAQ

Test 28

Subtask: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
QAQ

Test 29

Subtask: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
QAQ

Test 30

Subtask: 2

Verdict:

input
0001011011

correct output
4
1 1 1 1 

user output
1 2 1 1 

Test 31

Subtask: 2

Verdict:

input
0010110011

correct output
4
1 1 1 1 

user output
1 2 1 1 

Test 32

Subtask: 2

Verdict:

input
0011100000

correct output
2
2 1 

user output
1 2 1 

Test 33

Subtask: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
1 2 1 1 

Test 34

Subtask: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
QAQ

Test 35

Subtask: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

Test 36

Subtask: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ

Test 37

Subtask: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ

Test 38

Subtask: 2

Verdict:

input
110011001100110011001100110011...

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

user output
1 2 3 4 5 6 7 8 1 2 1 1 2 3 1 ...

Test 39

Subtask: 2

Verdict:

input
010101010101010101010101010101...

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
QAQ

Test 40

Subtask: 2

Verdict:

input
011010000011111011110000110011...

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

user output
1 2 3 4 5 6 7 8 9 10 11 1 2 3 ...

Test 41

Subtask: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Subtask: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
1 2 1 1 

Test 43

Subtask: 3

Verdict:

input
0100110110

correct output
4
2 1 1 1 

user output
1 2 1 1 

Test 44

Subtask: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
QAQ

Test 45

Subtask: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
QAQ

Test 46

Subtask: 3

Verdict:

input
0011100011

correct output
3
1 2 1 

user output
1 2 1 

Test 47

Subtask: 3

Verdict:

input
0100111100

correct output
3
1 1 1 

user output
1 1 1 

Test 48

Subtask: 3

Verdict:

input
0001001000

correct output
3
2 2 1 

user output
1 2 1 1 

Test 49

Subtask: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
QAQ

Test 50

Subtask: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
QAQ

Test 51

Subtask: 3

Verdict:

input
1000111011

correct output
3
2 1 1 

user output
QAQ

Test 52

Subtask: 3

Verdict:

input
1000111111

correct output
2
1 1 

user output
1 1 

Test 53

Subtask: 3

Verdict:

input
0110011100

correct output
3
2 1 1 

user output
1 2 1 1 

Test 54

Subtask: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
QAQ

Test 55

Subtask: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

Test 56

Subtask: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 57

Subtask: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 58

Subtask: 3

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 59

Subtask: 3

Verdict:

input
010101010101010101010101010101...

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

user output
QAQ

Test 60

Subtask: 3

Verdict:

input
011100011001011111111000010110...

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

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 61

Subtask: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Subtask: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
QAQ

Test 63

Subtask: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
QAQ

Test 64

Subtask: 4

Verdict:

input
1001110001

correct output
3
2 1 1 

user output
QAQ

Test 65

Subtask: 4

Verdict:

input
1000000011

correct output
2
1 1 

user output
1 1 

Test 66

Subtask: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
1 2 1 1 

Test 67

Subtask: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
QAQ

Test 68

Subtask: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
1 2 1 1 

Test 69

Subtask: 4

Verdict:

input
0011111000

correct output
2
2 1 

user output
1 2 1 

Test 70

Subtask: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
QAQ

Test 71

Subtask: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
1 2 1 1 

Test 72

Subtask: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
1 2 1 1 

Test 73

Subtask: 4

Verdict:

input
1110011111

correct output
2
2 1 

user output
1 2 1 

Test 74

Subtask: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
QAQ

Test 75

Subtask: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

Test 76

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Subtask: 4

Verdict:

input
110011001100110011001100110011...

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

user output
(empty)

Test 79

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

Subtask: 4

Verdict:

input
111000110000011000001101010010...

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

user output
(empty)