Submission details
Task:Bittipeli
Sender:quasisphere
Submission time:2015-09-30 11:46:25 +0300
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED11
#2ACCEPTED27
#3ACCEPTED28
#4ACCEPTED34
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.06 s1details
#7ACCEPTED0.06 s1details
#8ACCEPTED0.06 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.06 s1details
#11ACCEPTED0.05 s1details
#12ACCEPTED0.05 s1details
#13ACCEPTED0.05 s1details
#14ACCEPTED0.05 s1details
#15ACCEPTED0.05 s1details
#16ACCEPTED0.06 s1details
#17ACCEPTED0.05 s1details
#18ACCEPTED0.06 s1details
#19ACCEPTED0.05 s1details
#20ACCEPTED0.06 s1details
#21ACCEPTED0.05 s2details
#22ACCEPTED0.06 s2details
#23ACCEPTED0.05 s2details
#24ACCEPTED0.06 s2details
#25ACCEPTED0.06 s2details
#26ACCEPTED0.05 s2details
#27ACCEPTED0.06 s2details
#28ACCEPTED0.05 s2details
#29ACCEPTED0.05 s2details
#30ACCEPTED0.05 s2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.05 s2details
#33ACCEPTED0.05 s2details
#34ACCEPTED0.05 s2details
#35ACCEPTED0.06 s2details
#36ACCEPTED0.06 s2details
#37ACCEPTED0.05 s2details
#38ACCEPTED0.06 s2details
#39ACCEPTED0.06 s2details
#40ACCEPTED0.06 s2details
#41ACCEPTED0.05 s3details
#42ACCEPTED0.05 s3details
#43ACCEPTED0.06 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.00 s3details
#54ACCEPTED0.05 s3details
#55ACCEPTED0.05 s3details
#56ACCEPTED0.05 s3details
#57ACCEPTED0.05 s3details
#58ACCEPTED0.05 s3details
#59ACCEPTED0.05 s3details
#60ACCEPTED0.05 s3details
#61ACCEPTED0.06 s4details
#62ACCEPTED0.05 s4details
#63ACCEPTED0.06 s4details
#64ACCEPTED0.05 s4details
#65ACCEPTED0.06 s4details
#66ACCEPTED0.06 s4details
#67ACCEPTED0.06 s4details
#68ACCEPTED0.06 s4details
#69ACCEPTED0.05 s4details
#70ACCEPTED0.05 s4details
#71ACCEPTED0.05 s4details
#72ACCEPTED0.05 s4details
#73ACCEPTED0.05 s4details
#74ACCEPTED0.05 s4details
#75ACCEPTED0.05 s4details
#76ACCEPTED0.06 s4details
#77ACCEPTED0.06 s4details
#78ACCEPTED0.06 s4details
#79ACCEPTED0.06 s4details
#80ACCEPTED0.06 s4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:60:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int64_t i=0;i<s.size();i++) {
                    ^

Code

#include<iostream>
#include<list>

using namespace std;

list<int>::iterator find_mid(list<int> &l, int len) {
  list<int>::iterator iter=l.begin();
  for(int i=0;i<len/2;i++) iter++;
  return iter;
}

int eat(list<int> &blocks, list<int>::iterator iter, int id, int count=1000000) {
  int eaten=0;
  while(count > 0) {
    if(iter==blocks.begin()) break;
    list<int>::iterator next=iter;
    next++;
    if(next==blocks.end()) break;
    list<int>::iterator prev=iter;
    prev--;
    cout << id << ' ';
    if(*prev > 0) {
      eaten++;
      id--;
    }
    blocks.erase(prev);
    blocks.erase(next);
    count--;
  }
  return eaten;
}

int count_left(list<int> &blocks, list<int>::iterator &iter) {
  int cnt=0;
  while(*iter == 0) {
    cnt++;
    if(iter == blocks.begin()) break;
    iter--;
  }
  return cnt;
}

int count_right(list<int> &blocks, list<int>::iterator &iter) {
  int cnt=0;
  while(*iter == 0) {
    cnt++;
    iter++;
    if(iter == blocks.end()) break;
  }
  return cnt;
}

int main(void) {
  string s;
  cin >> s;
  list<int> blocks;
  int prev=-1;
  int bs=0;
  int bid=1;
  for(int64_t i=0;i<s.size();i++) {
    if(s[i] != prev) {
      if(bs == 1) blocks.push_back(0);
      else if(bs >= 2) blocks.push_back(bid++);
      prev=s[i];
      bs=1;
    } else {
      bs++;
    }
  }
  if(bs == 1) blocks.push_back(0);
  else if(bs >= 2) blocks.push_back(bid++);

  int len=blocks.size();

  if(len%2 == 1) {
    list<int>::iterator mid=find_mid(blocks, len);
    if(*mid > 0) {
      cout << len/2 + 1 << '\n';
      eat(blocks, mid, *mid);
      cout << 1 << '\n';
    } else {
      list<int>::iterator leftiter=mid;
      leftiter--;
      int a=count_left(blocks, leftiter);
      list<int>::iterator rightiter=mid;
      rightiter++;
      int b=count_right(blocks, rightiter);
      if(a+b+1 >= (len - 1)/2) {
        cout << "QAQ\n";
        return 0;
      }
      cout << len/2 + 1 << '\n';
      eat(blocks, rightiter, *rightiter, a+1);
      eat(blocks, leftiter, *leftiter);
      cout << 1 << '\n';
    }
  } else {
    list<int>::iterator rmid=find_mid(blocks, len);
    list<int>::iterator leftiter=rmid;
    leftiter--;
    int a=count_left(blocks, leftiter);
    list<int>::iterator rightiter=rmid;
    int b=count_right(blocks, rightiter);
    if(len/2 - a - 1 < b) { //TARKISTA
      cout << "QAQ\n";
      return 0;
    }
    if(blocks.front() > 0) {
      cout << len/2 + 1 << '\n';
      int eaten=eat(blocks, leftiter, *leftiter, b);
      eat(blocks, rightiter, *rightiter - eaten);
      cout << "1 1\n";
    } else if(blocks.back() > 0) {
      cout << len/2 + 1 << '\n';
      eat(blocks, rightiter, *rightiter, a);
      eat(blocks, leftiter, *leftiter);
      cout << "1 1\n";
    } else {
      list<int>::iterator startiter=blocks.begin();
      list<int>::iterator enditer=blocks.end();
      enditer--;
      int x=count_right(blocks, startiter);
      int y=count_left(blocks, enditer);
      if(x <= b) {
        cout << len/2 + 1 << '\n';
        int eaten=eat(blocks, leftiter, *leftiter, b-x);
        eaten+=eat(blocks, startiter, *startiter, x);
        eat(blocks, rightiter, *rightiter - eaten);
        cout << "1 1\n";
      } else if(y <= a) {
        cout << len/2 + 1 << '\n';
        int eaten=eat(blocks, rightiter, *rightiter, a-y);
        eat(blocks, enditer, *enditer - eaten, y);
        eat(blocks, leftiter, *leftiter);
        cout << "1 1\n";
      } else if(x+y <= len/2-1) {
        if(x <= y) {
          cout << len/2 + 1 << '\n';
          int eaten=eat(blocks, startiter, *startiter, x);
          eat(blocks, enditer, *enditer - eaten, x-b);
          eat(blocks, rightiter, *rightiter - eaten);
          cout << "1 1\n";
        } else {
          cout << len/2 + 1 << '\n';
          eat(blocks, enditer, *enditer, y);
          int eaten=eat(blocks, startiter, *startiter, y-a);
          eat(blocks, leftiter, *leftiter - eaten);
          cout << "1 1\n";
        }
      } else {
        cout << "QAQ\n" << endl;
      }
    }
  }
  return 0;
}

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

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

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

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
2 1 1

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

correct output
3
1 2 1 

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

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
2 1 1

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

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

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
3
3 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: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

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

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

correct output
3
2 1 1 

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

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

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

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

correct output
4
2 1 1 1 

user output
4
2 1 1 1

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ

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
20 19 18 17 16 15 14 13 12 11 ...

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

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 58

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

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

user output
1501
1000 999 998 997 996 995 994 9...

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
648 648 647 647 646 645 645 64...

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

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

Test 76

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 77

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ

Test 78

Group: 4

Verdict: ACCEPTED

input
110011001100110011001100110011...

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

user output
30001
20000 19999 19998 19997 19996 ...

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
12472 12471 12470 12469 12468 ...