Bittipeli

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) ans[i]--;
                      ^
input/code.cpp:12:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 1; i < ans.size(); ++i) {
                          ^
input/code.cpp:25: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:46:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < v.size()/2+1; ++i) {
                          ^
input/code.cpp:56:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = v.size()/2+1; j+q+1 < v.size(); ++j)...

#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;
        }
        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()+last);
        }
        else {
            v.erase(v.begin()+ans[last-1], v.begin()+last+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 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: WRONG ANSWER

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: WRONG ANSWER

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 1

Verdict: WRONG ANSWER

Test 16

Group: 1

Verdict: WRONG ANSWER

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 1

Verdict: ACCEPTED

Test 19

Group: 1

Verdict: ACCEPTED

Test 20

Group: 1

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: WRONG ANSWER

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: WRONG ANSWER

Test 27

Group: 2

Verdict: WRONG ANSWER

Test 28

Group: 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: ACCEPTED

Test 30

Group: 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: ACCEPTED

Test 32

Group: 2

Verdict: ACCEPTED

Test 33

Group: 2

Verdict: ACCEPTED

Test 34

Group: 2

Verdict: WRONG ANSWER

Test 35

Group: 2

Verdict: WRONG ANSWER

Test 36

Group: 2

Verdict: WRONG ANSWER

Test 37

Group: 2

Verdict: WRONG ANSWER

Test 38

Group: 2

Verdict: WRONG ANSWER

Test 39

Group: 2

Verdict: ACCEPTED

Test 40

Group: 2

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: WRONG ANSWER

Test 43

Group: 3

Verdict: ACCEPTED

Test 44

Group: 3

Verdict: ACCEPTED

Test 45

Group: 3

Verdict: ACCEPTED

Test 46

Group: 3

Verdict: WRONG ANSWER

Test 47

Group: 3

Verdict: ACCEPTED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: ACCEPTED

Test 50

Group: 3

Verdict: WRONG ANSWER

Test 51

Group: 3

Verdict: ACCEPTED

Test 52

Group: 3

Verdict: ACCEPTED

Test 53

Group: 3

Verdict: ACCEPTED

Test 54

Group: 3

Verdict: ACCEPTED

Test 55

Group: 3

Verdict: WRONG ANSWER

Test 56

Group: 3

Verdict: WRONG ANSWER

Test 57

Group: 3

Verdict: WRONG ANSWER

Test 58

Group: 3

Verdict: WRONG ANSWER

Test 59

Group: 3

Verdict: ACCEPTED

Test 60

Group: 3

Verdict: WRONG ANSWER

Test 61

Group: 4

Verdict: WRONG ANSWER

Test 62

Group: 4

Verdict: ACCEPTED

Test 63

Group: 4

Verdict: ACCEPTED

Test 64

Group: 4

Verdict: ACCEPTED

Test 65

Group: 4

Verdict: ACCEPTED

Test 66

Group: 4

Verdict: ACCEPTED

Test 67

Group: 4

Verdict: ACCEPTED

Test 68

Group: 4

Verdict: ACCEPTED

Test 69

Group: 4

Verdict: ACCEPTED

Test 70

Group: 4

Verdict: ACCEPTED

Test 71

Group: 4

Verdict: WRONG ANSWER

Test 72

Group: 4

Verdict: ACCEPTED

Test 73

Group: 4

Verdict: ACCEPTED

Test 74

Group: 4

Verdict: ACCEPTED

Test 75

Group: 4

Verdict: WRONG ANSWER

Test 76

Group: 4

Verdict: WRONG ANSWER

Test 77

Group: 4

Verdict: WRONG ANSWER

Test 78

Group: 4

Verdict: WRONG ANSWER

Test 79

Group: 4

Verdict: ACCEPTED

Test 80

Group: 4

Verdict: WRONG ANSWER