CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:yhyy ääh yhyy
Submission time:2015-09-28 21:47:00 +0300
Language:C++
Status:READY
Result:11
Feedback
groupverdictscore
#1ACCEPTED11
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.06 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.06 s1details
#11ACCEPTED0.06 s1details
#12ACCEPTED0.05 s1details
#13ACCEPTED0.06 s1details
#14ACCEPTED0.05 s1details
#15ACCEPTED0.06 s1details
#16ACCEPTED0.05 s1details
#17ACCEPTED0.05 s1details
#18ACCEPTED0.06 s1details
#19ACCEPTED0.06 s1details
#20ACCEPTED0.05 s1details
#210.15 s2details
#22ACCEPTED0.06 s2details
#23ACCEPTED0.06 s2details
#24ACCEPTED0.06 s2details
#25ACCEPTED0.06 s2details
#26ACCEPTED0.07 s2details
#27ACCEPTED0.05 s2details
#28ACCEPTED0.06 s2details
#29ACCEPTED0.05 s2details
#30ACCEPTED0.05 s2details
#31ACCEPTED0.06 s2details
#32ACCEPTED0.06 s2details
#33ACCEPTED0.06 s2details
#340.15 s2details
#35ACCEPTED0.05 s2details
#360.15 s2details
#370.16 s2details
#38ACCEPTED0.05 s2details
#39ACCEPTED0.06 s2details
#40ACCEPTED0.06 s2details
#41ACCEPTED0.06 s3details
#42ACCEPTED0.05 s3details
#43ACCEPTED0.05 s3details
#44ACCEPTED0.06 s3details
#45ACCEPTED0.05 s3details
#46ACCEPTED0.06 s3details
#47ACCEPTED0.06 s3details
#48ACCEPTED0.06 s3details
#49ACCEPTED0.05 s3details
#50ACCEPTED0.06 s3details
#51ACCEPTED0.06 s3details
#52ACCEPTED0.05 s3details
#53ACCEPTED0.06 s3details
#54ACCEPTED0.05 s3details
#55ACCEPTED0.04 s3details
#560.14 s3details
#570.15 s3details
#58ACCEPTED0.06 s3details
#59ACCEPTED0.05 s3details
#60ACCEPTED0.05 s3details
#610.14 s4details
#62ACCEPTED0.05 s4details
#63ACCEPTED0.05 s4details
#64ACCEPTED0.05 s4details
#65ACCEPTED0.05 s4details
#66ACCEPTED0.05 s4details
#67ACCEPTED0.06 s4details
#68ACCEPTED0.05 s4details
#69ACCEPTED0.06 s4details
#70ACCEPTED0.05 s4details
#71ACCEPTED0.05 s4details
#72ACCEPTED0.05 s4details
#73ACCEPTED0.06 s4details
#74ACCEPTED0.05 s4details
#75ACCEPTED0.05 s4details
#760.15 s4details
#770.16 s4details
#78ACCEPTED0.05 s4details
#79ACCEPTED0.06 s4details
#80ACCEPTED0.05 s4details

Compiler report

input/code.cpp: In function 'void f2(std::vector<int>)':
input/code.cpp:9:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < ans.size(); ++i) {
                      ^
input/code.cpp:14:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 1; i < ans.size(); ++i) {
                          ^
input/code.cpp:30:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(q == v.size() || ans[last-1] == 0) {
              ^
input/code.cpp: In function 'int f(std::vector<int>)':
input/code.cpp:51:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < v.size()/2+1; ++i) {
                          ^
input/code.cpp:61:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = v.size()/2+1; j+q+1 < v.size(); ++j) {

Code

#include <iostream>
#include <vector>
using namespace std;
vector<int> ans;


void f2(vector<int> v) {
    vector<int> ans2;
    for(int i = 0; i < ans.size(); ++i) {
        ans[i]--;
    }
    while(ans.size()) {
        int last = 1;
        for(int i = 1; i < ans.size(); ++i) {
            if(ans[i] == ans[i-1]-1) {
                ++last;
            }
            else break;
        }
        int cnt = 0;
        for(int i = 0; i <= ans[0]; ++i) {
            if(v[i] == 1) ++cnt;
        }
        ++cnt;
        for(int i = 0; i < last; ++i) {
            if(v[ans[i]] == 1) --cnt;
            ans2.push_back(cnt);
        }
        int q = ans[0] + last;
        if(q == v.size() || ans[last-1] == 0) {
            v.erase(v.begin()+ans[last-1], v.begin()+q);
        }
        else {
            v.erase(v.begin()+ans[last-1], v.begin()+q+1);
            v[ans[last-1]-1] = 1;
        }
        ans.erase(ans.begin(), ans.begin()+last);
    }
    ans = ans2;

}
int f(vector<int> v) {
    /*
    for(int i = 0; i < v.size(); ++i) {
        cout<<v[i]<<' ';
    }
    cout<<'\n';
    */
    if(v[v.size()/2] == 1) {
        int sz = v.size();
        for(int i = 0; i < v.size()/2+1; ++i) {
            ans.push_back(sz/2+1);
            sz -= 2;
        }
        return 1;
    }
    for(int i = v.size()/2; i >= 0; --i) {
        if(v[i] == 1) {
            int q = v.size()/2-i;
            int sz = v.size();
            for(int j = v.size()/2+1; j+q+1 < v.size(); ++j) {
                if(v[j] == 1) {
                    for(int k = 0; k < q; ++k) {
                        ans.push_back(j+1);
                        --j;
                        sz -= 2;
                    }
                    while(sz > 0) {
                        ans.push_back(sz/2+1);
                        sz -= 2;
                    }
                    return 1;
                }
            }
            break;
        }
    }
    for(int i = v.size()/2; i < v.size(); ++i) {
        if(v[i] == 1) {
            int q = i-v.size()/2;
            int sz = v.size();
            for(int j = v.size()/2-1; j >= q; --j) {
                if(v[j] == 1) {
                    for(int k = 0; k < q; ++k) {
                        ans.push_back(j+1);
                        --j;
                        sz -= 2;
                    }
                    while(sz > 0) {
                        ans.push_back(sz/2+1);
                        sz -= 2;
                    }
                    return 1;
                }
            }
            break;
        }
    }
    return 0;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    string s;
    cin>>s;
    vector<int> v;
    for(int i = 0; i < s.size(); ++i) {
        if(i+1 < s.size()) {
            if(s[i] == s[i+1]) {
                int q = s[i];
                v.push_back(1);
                while(i < s.size() && s[i] == q) {
                    ++i;
                }
                --i;
            }
            else {
                v.push_back(0);
            }
        }
        else {
            v.push_back(0);
        }
    }
    /*
    for(int i = 0; i < v.size(); ++i) {
        cout<<v[i]<<' ';
    }
    cout<<'\n';
    */
    if(s[0] == s.back()) {
        if(f(v)) {
            f2(v);
            cout<<ans.size()<<'\n';
            for(int i = 0; i < ans.size(); ++i) {
                cout<<ans[i]<<' ';
            }
            cout<<'\n';
        }
        else {
            cout<<"QAQ\n";
        }
    }
    else {
        vector<int> v2;
        for(int i = 0; i < v.size(); ++i) {
            if(v[i] == 1) {
                int sz = v.size();
                if(i < v.size()/2) {
                    if(v[(i*2+1+v.size())/2] == 1) {
                        for(int j = i; j >= 0; --j) {
                            ans.push_back(j+1);
                            sz -= 2;
                        }
                        ++sz;
                        while(sz > 0) {
                            ans.push_back(sz/2+1);
                            sz -= 2;
                        }
                        goto ohi;
                    }
                }
                else {
                    int q = v.size()-i-1;
                    if(v[q/2] == 1) {
                        for(int j = i; j > q; --j) {
                            ans.push_back(j+1);
                            sz -= 2;
                        }
                        ++sz;
                        while(sz > 0) {
                            ans.push_back(sz/2+1);
                            sz -= 2;
                        }
                        goto ohi;
                    }
                }
            }
        }
        for(int i = 0; i < v.size()/2; ++i) {
            if(v[i] == 1) {
                for(int j = i; j >= 0; --j) {
                    ans.push_back(j+1);
                }
                v2.assign(v.begin()+i*2+1, v.end());
                if(f(v2)) {
                    goto ohi;
                }
                ans.clear();
                break;
            }
        }
        for(int i = (int)v.size()-1; i >= v.size()/2; --i) {
            if(v[i] == 1) {
                int q = v.size()-i-1;
                for(int j = i; j > q; --j) {
                    ans.push_back(j+1);
                }
                v2.assign(v.begin(), v.begin()+q+1);
                if(f(v2)) {
                    goto ohi;
                }
                ans.clear();
                break;
            }
        }
        cout<<"QAQ\n";
        return 0;
        ohi:;
            f2(v);
        cout<<ans.size()<<'\n';
        for(int i = 0; i < ans.size(); ++i) {
            cout<<ans[i]<<' ';
        }
        cout<<'\n';
    }
}

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

input
1110010100

correct output
QAQ

user output
(empty)

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

input
0110110111

correct output
4
2 1 1 1 

user output
(empty)

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

input
110011001100110011001100110011...

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

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

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
13 13 12 11 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: 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
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
1 2 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
2 1 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
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: 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: ACCEPTED

input
110011001100110011001100110011...

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

user output
1501
501 500 499 498 497 496 495 49...

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
1272
2 1 1 646 646 645 644 644 643 ...

Test 61

Group: 4

Verdict:

input
1110101110

correct output
QAQ

user output
(empty)

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

input
110011001100110011001100110011...

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

user output
30001
10001 10000 9999 9998 9997 999...

Test 79

Group: 4

Verdict: ACCEPTED

input
010101010101010101010101010101...

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 80

Group: 4

Verdict: ACCEPTED

input
111000110000011000001101010010...

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

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