CodeForces - 950C Zebras VirtualJudge 500题AC留念

Oleg writes down the history of the days he lived. For each day he decides if it was good or bad. Oleg calls a non-empty sequence of days a zebra, if it starts with a bad day, ends with a bad day, and good and bad days are alternating in it. Let us denote bad days as 0 and good days as 1. Then, for example, sequences of days 0, 010, 01010 are zebras, while sequences 1, 0110, 0101 are not.

Oleg tells you the story of days he lived in chronological order in form of string consisting of 0 and 1. Now you are interested if it is possible to divide Oleg's life history into several subsequences, each of which is a zebra, and the way it can be done. Each day must belong to exactly one of the subsequences. For each of the subsequences, days forming it must be ordered chronologically. Note that subsequence does not have to be a group of consecutive days.

Input

In the only line of input data there is a non-empty string s consisting of characters 0 and 1, which describes the history of Oleg's life. Its length (denoted as |s|) does not exceed 200 000 characters.

Output

If there is a way to divide history into zebra subsequences, in the first line of output you should print an integer k (1 ≤ k ≤ |s|), the resulting number of subsequences. In the i-th of following k lines first print the integer l_i (1 ≤ l_i ≤ |s|), which is the length of the i-th subsequence, and then l_i indices of days forming the subsequence. Indices must follow in ascending order. Days are numbered starting from 1. Each index from 1 to n must belong to exactly one subsequence. If there is no way to divide day history into zebra subsequences, print -1.

Subsequences may be printed in any order. If there are several solutions, you may print any of them. You do not have to minimize nor maximize the value of k.

Example

Input

0010100

Output

3
3 1 3 4
3 2 5 6
1 7

Input

111

Output

-1

超级大模拟
碰到0，优先加入1结尾的数列，不然新建一个数列
碰到1，加入以0结尾的数列，如果没有以0结尾的数列，那么就不存在可xing的分配情况
最后再检测是否全部数列都以0结尾，如果存在以1结尾的数列那么不存在可行的分配情况
另外需要注意的是，建立一个1结尾队列索引和0结尾队列索引的数列，不需要每次去真的
找一遍0结尾和1结尾的队列

代码:

#include<iostream>
using namespace std;
#include<cstdio>
#include<cstring>
#include<vector>
#include<cstdlib>
const int maxn = 1e5*5;
char s[maxn];
vector<int> a[maxn];
vector<int> v0;
vector<int> v1;
int num = 0;
int main(){
    scanf("%s",s);
    int ok=1;
    int len =strlen(s);
    int pt;
    for(int i=0;i<len;i++){
        s[i] = s[i] - '0';
        if(s[i]==0){
            if(v1.size()==0){
                v0.push_back(num);
                a[num].push_back(i+1);
                num+=1;
            }
            else{
                pt = v1[v1.size()-1];
                v1.pop_back();
                v0.push_back(pt);
                a[pt].push_back(i+1);
            }
        }
        else if(s[i]==1){
            if(v0.size()==0){
                ok=0;
                break;
            }
            else{
                int pt = v0[v0.size()-1];
                v0.pop_back();
                v1.push_back(pt);
                a[pt].push_back(i+1);
            }
        }
    }
    if(v1.size()!=0)
        ok = 0;
    if(ok==0){
        printf("-1");
    }
    else{
        printf("%d\n",num);
        for(int i=0;i<num;i++){
            printf("%d",a[i].size());
            for(int j=0;j<a[i].size();j++){
                printf(" %d",a[i][j]);
            }
            putchar('\n');
        }
    }
    return 0;
}