Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-09-28 22:50:47100
2015-09-28 22:25:470
2015-09-28 22:21:3211
2015-09-28 22:19:4611
2015-09-28 22:11:170
2015-09-28 22:10:340
2015-09-28 22:01:1611
2015-09-28 21:53:1011
2015-09-28 21:52:4211
2015-09-28 21:47:0011
2015-09-28 21:43:3111
2015-09-28 21:40:080
2015-09-28 21:39:140
2015-09-28 20:39:500
2015-09-28 20:38:360
Task:Bittipeli
Sender:yhyy ääh yhyy
Submission time:2015-09-28 22:50:47
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED11
#2ACCEPTED27
#3ACCEPTED28
#4ACCEPTED34

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.001details
#2ACCEPTED0.06 / 1.001details
#3ACCEPTED0.05 / 1.001details
#4ACCEPTED0.05 / 1.001details
#5ACCEPTED0.05 / 1.001details
#6ACCEPTED0.05 / 1.001details
#7ACCEPTED0.05 / 1.001details
#8ACCEPTED0.05 / 1.001details
#9ACCEPTED0.06 / 1.001details
#10ACCEPTED0.05 / 1.001details
#11ACCEPTED0.05 / 1.001details
#12ACCEPTED0.06 / 1.001details
#13ACCEPTED0.05 / 1.001details
#14ACCEPTED0.06 / 1.001details
#15ACCEPTED0.06 / 1.001details
#16ACCEPTED0.05 / 1.001details
#17ACCEPTED0.05 / 1.001details
#18ACCEPTED0.05 / 1.001details
#19ACCEPTED0.06 / 1.001details
#20ACCEPTED0.05 / 1.001details
#21ACCEPTED0.06 / 1.002details
#22ACCEPTED0.06 / 1.002details
#23ACCEPTED0.06 / 1.002details
#24ACCEPTED0.06 / 1.002details
#25ACCEPTED0.05 / 1.002details
#26ACCEPTED0.06 / 1.002details
#27ACCEPTED0.06 / 1.002details
#28ACCEPTED0.05 / 1.002details
#29ACCEPTED0.05 / 1.002details
#30ACCEPTED0.06 / 1.002details
#31ACCEPTED0.06 / 1.002details
#32ACCEPTED0.06 / 1.002details
#33ACCEPTED0.05 / 1.002details
#34ACCEPTED0.04 / 1.002details
#35ACCEPTED0.03 / 1.002details
#36ACCEPTED0.05 / 1.002details
#37ACCEPTED0.05 / 1.002details
#38ACCEPTED0.06 / 1.002details
#39ACCEPTED0.05 / 1.002details
#40ACCEPTED0.05 / 1.002details
#41ACCEPTED0.05 / 1.003details
#42ACCEPTED0.05 / 1.003details
#43ACCEPTED0.06 / 1.003details
#44ACCEPTED0.05 / 1.003details
#45ACCEPTED0.06 / 1.003details
#46ACCEPTED0.05 / 1.003details
#47ACCEPTED0.05 / 1.003details
#48ACCEPTED0.06 / 1.003details
#49ACCEPTED0.06 / 1.003details
#50ACCEPTED0.05 / 1.003details
#51ACCEPTED0.06 / 1.003details
#52ACCEPTED0.06 / 1.003details
#53ACCEPTED0.06 / 1.003details
#54ACCEPTED0.06 / 1.003details
#55ACCEPTED0.05 / 1.003details
#56ACCEPTED0.06 / 1.003details
#57ACCEPTED0.05 / 1.003details
#58ACCEPTED0.06 / 1.003details
#59ACCEPTED0.05 / 1.003details
#60ACCEPTED0.05 / 1.003details
#61ACCEPTED0.05 / 1.004details
#62ACCEPTED0.05 / 1.004details
#63ACCEPTED0.05 / 1.004details
#64ACCEPTED0.05 / 1.004details
#65ACCEPTED0.06 / 1.004details
#66ACCEPTED0.05 / 1.004details
#67ACCEPTED0.05 / 1.004details
#68ACCEPTED0.05 / 1.004details
#69ACCEPTED0.05 / 1.004details
#70ACCEPTED0.05 / 1.004details
#71ACCEPTED0.06 / 1.004details
#72ACCEPTED0.05 / 1.004details
#73ACCEPTED0.05 / 1.004details
#74ACCEPTED0.05 / 1.004details
#75ACCEPTED0.05 / 1.004details
#76ACCEPTED0.06 / 1.004details
#77ACCEPTED0.05 / 1.004details
#78ACCEPTED0.05 / 1.004details
#79ACCEPTED0.06 / 1.004details
#80ACCEPTED0.07 / 1.004details

Compiler report

input/code.cpp: In function 'int f2(std::vector<int>)':
input/code.cpp:10:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < ans.size(); ++i) {
                      ^
input/code.cpp:18:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 1; i < ans.size(); ++i) {
                          ^
input/code.cpp:34: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:56:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < v.size()/2+1; ++i) {
                          ^
input/code.cpp:66:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = v.size()/2+1; j+q < v.size(); ++j) {

Code

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


int f2(vector<int> v) {
    vector<int> ans2;
    for(int i = 0; i < ans.size(); ++i) {
        //cout<<ans[i]<<' ';

        ans[i]--;
    }
    //cout<<endl;;
    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.at(i) == 1) ++cnt;
        }
        ++cnt;
        for(int i = 0; i < last; ++i) {
            if(v.at(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.at(ans[last-1]-1) = 1;
        }
        ans.erase(ans.begin(), ans.begin()+last);
    }
    ans = ans2;
    return 0;

}
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 < 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);
    //for(int i =0; i < 100000; ++i) {
        string s;
    //    ans.clear();
        cin>>s;
        /*
        for(int j = 0; j < 20; ++j) {
            s.push_back('0'+rand()%2);
        }
        */
        //cout<<s<<'\n';
        //return 0;
        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;
                            }
                //            cout<<"ASD\n";
                            goto ohi;
                        }
                    }
                    else {
                        int q = v.size()-i-1;
                        if(v[(v.size()-q*2-1)/2] == 1) {
                            for(int j = i; j >= i-q; --j) {
                                ans.push_back(j+1);
                                sz -= 2;
                            }
                            ++sz;
                            while(sz > 0) {
                                ans.push_back(sz/2+1);
                                sz -= 2;
                            }
                 //           cout<<"AS2D\n";
                            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();
                  //          cout<<"xxASD\n";
                    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 >= i-q; --j) {
                        ans.push_back(j+1);
                    }
                    v2.assign(v.begin(), v.begin()+i-q);
                    if(f(v2)) {
                   //         cout<<"ASDwww\n";
                        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

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

view   save

correct output
3
1 2 1 

view   save

user output
3
1 2 1 

view   save

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

view   save

correct output
4
1 2 1 1 

view   save

user output
4
2 2 1 1 

view   save

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

view   save

correct output
4
2 2 2 1 

view   save

user output
4
2 2 2 1 

view   save

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

view   save

correct output
3
3 2 1 

view   save

user output
3
3 2 1 

view   save

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

view   save

correct output
3
3 2 1 

view   save

user output
3
3 2 1 

view   save

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

view   save

correct output
4
2 1 1 1 

view   save

user output
4
3 2 1 1 

view   save

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 38

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
31
1 20 20 20 20 20 20 20 20 20 2...
view   save

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

Test 39

Group: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...
view   save

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

user output
23
13 13 12 11 11 11 11 10 9 9 9 ...
view   save

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

view   save

correct output
3
1 2 1 

view   save

user output
3
1 2 1 

view   save

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 58

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
1501
1 1000 1000 1000 1000 1000 100...
view   save

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

Test 59

Group: 3

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 60

Group: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...
view   save

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

user output
1272
2 1 1 646 646 645 644 644 643 ...
view   save

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 67

Group: 4

Verdict: ACCEPTED

input
0100111010

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

view   save

correct output
4
2 2 2 1 

view   save

user output
4
2 2 2 1 

view   save

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

view   save

correct output
3
3 2 1 

view   save

user output
3
3 2 1 

view   save

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 74

Group: 4

Verdict: ACCEPTED

input
1011000101

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 76

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 77

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 78

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
30001
1 20000 20000 20000 20000 2000...
view   save

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

Test 79

Group: 4

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 80

Group: 4

Verdict: ACCEPTED

input
111000110000011000001101010010...
view   save

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

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