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-10-11 23:22:4727
2015-10-11 11:51:350
Task:Bittipeli
Sender:Ollie
Submission time:2015-10-11 23:22:47
Language:C++
Status:READY
Score:27

Feedback

groupverdictscore
#1WRONG ANSWER0
#2ACCEPTED27
#3WRONG ANSWER0
#4WRONG ANSWER0

Test results

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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:50:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(;k<thing.size();k++) {
               ^
input/code.cpp:59:63: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     if(length > maxlen && (start >= 2 || ends < thing.size()-2)) {
                                                               ^
input/code.cpp:79:59: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(length > maxlen && (start >= 2 || ends < thing.size()-2)) {
                                                           ^

Code

#include <bits/stdc++.h>

#define _ ios_base::sync_with_stdio(0);cin.tie();
#define mp make_pair
#define pb push_back

#define ll long long
#define pii pair<int,int>
#define vpii vector<pii>
#define vi vector<int>

#define INF 2147483647
using namespace std;

int main() { _
    string in;
    cin >> in;

    int l = in.length();
    if(l==1) {
        cout << "QAQ";
        return 0;
    }

    vi thing;

    int pr = 0, i = 1;
    for(i=1;i<l;i++) {
        if(in[i] != in[pr]) {
            if(i-pr == 1) {
                thing.pb(1);
            } else {
                thing.pb(i-pr);
            }
            pr = i;
        }
    }

    if(i-pr == 1) thing.pb(1);
    else thing.pb(i-pr);

    vi trm;

    while(true) {

        vpii possible;
        int len = 0, k = 0;
        int maxlen = 0, pos = -1;
        int rmid = 0, rmfid = -1;
        for(;k<thing.size();k++) {
            int val = thing[k];
            if(val == 1) {
                len++;
            } else {
                if(len>0) {
                    int ends = k-1;
                    int length = len;
                    int start = ends-length+1;
                    if(length > maxlen && (start >= 2 || ends < thing.size()-2)) {
                        pos = start;
                        maxlen = length;
                        if(rmid == 0)
                            rmfid = 1;
                        else
                            rmfid = rmid;
                    }
                }
                len = 0;
                rmid++;
            }
        }
        k--;
        if(thing[k]==1) {
            k++;
            if(len>0) {
                int ends = k-1;
                int length = len;
                int start = ends-length+1;
                if(length > maxlen && (start >= 2 || ends < thing.size()-2)) {
                    pos = start;
                    maxlen = length;
                    if(rmid == 0)
                        rmfid = 1;
                    else
                        rmfid = rmid;
                }
            }
        }

       if(maxlen == 0 || pos == -1) {
            //cout << "no more ones found" << endl;
            break;
        } else {
           // cout << "pos: " << pos << ", len: " << maxlen << " <- remove group number " << rmfid << endl;
        }

        if(pos >= 2) {
            int newn = thing[pos-2]+1;
            thing[pos] = newn;
            thing.erase(thing.begin() + pos-1);
            thing.erase(thing.begin() + pos-2);
        } else {
            pos = pos + maxlen-1;
            int newn = thing[pos+2]+1;
            thing[pos] = newn;
            thing.erase(thing.begin() + pos+1);
            thing.erase(thing.begin() + pos+1);
        }

        trm.pb(rmfid);
    }

    for(auto x : thing) {
        if(x == 1) {
            cout << "QAQ" << endl;
            return 0;
        } else {
            trm.pb(1);
        }
    }

    cout << trm.size() << endl;
    for(auto n : trm) {
        cout << n << " ";
    } cout << endl;

    return 0;
}

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
4
1 1 1 1
view   save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
0100100100
view   save

correct output
4
2 1 1 1
view   save

user output
QAQ
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
3 1 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
4
1 1 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
5
1 1 1 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
5
1 1 1 1 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
3 1 1 1
view   save

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100
view   save

correct output
3
3 2 1
view   save

user output
4
2 1 1 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
4
1 1 1 1
view   save

Test 19

Group: 1

Verdict: WRONG ANSWER

input
0110000100
view   save

correct output
3
2 1 1
view   save

user output
QAQ
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
1 2 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
3
1 1 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
1 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
3 1 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
40
20 19 18 17 16 15 14 13 12 11 ...
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
28
14 13 10 12 21 1 8 8 11 19 1 2...
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
1 1 2 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
1 1 2 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: WRONG ANSWER

input
0001001110
view   save

correct output
3
2 2 1
view   save

user output
3
1 2 1
view   save

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011
view   save

correct output
3
1 2 1
view   save

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

input
1000111011
view   save

correct output
3
2 1 1
view   save

user output
QAQ
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
4
1 1 1 1
view   save

Test 54

Group: 3

Verdict: WRONG ANSWER

input
0001000110
view   save

correct output
3
2 2 1
view   save

user output
3
1 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
3 1 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
2000
1000 999 998 997 996 995 994 9...
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
1541
840 288 839 865 287 359 524 83...
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
1 2 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
3
1 1 1
view   save

Test 70

Group: 4

Verdict: WRONG ANSWER

input
1101001101
view   save

correct output
4
2 2 2 1
view   save

user output
4
1 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
4
1 1 1 1
view   save

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111
view   save

correct output
3
3 2 1
view   save

user output
4
3 1 1 1
view   save

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111
view   save

correct output
2
2 1
view   save

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

Test 76

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
(no output)
view   save

Test 77

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
(no output)
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
40000
20000 19999 19998 19997 19996 ...
view   save

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

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
(no output)
view   save

Test 80

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
111000110000011000001101010010...
view   save

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

user output
(no output)
view   save