codeforce Zebras(思维 + 模拟)

题目链接

http://codeforces.com/group/5yyKg9gx7m/contest/265809/problem/C

题面

C. Zebras
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
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 li (1 ≤ li ≤ |s|), which is the length of the i-th subsequence, and then li 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.

Examples
inputCopy
0010100
outputCopy
3
3 1 3 4
3 2 5 6
1 7
inputCopy
111
output

题意

给你一个01串，要你把它变成很多个以0开始，以0结束并且它是0101010这样子交替出现01的串。

单独一个0也可以作为一个串。

要求每个串中的数字，都要按原串中出现的先后顺序

思路

题目难度不难，写代码时试了很多方法，一直没能实现。

用vector，遇到零就往下走，遇到1就往上走

例如上图，最后横向输出即可。

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
char s[maxn];
vector <int> a[maxn];
int main()
{
    scanf("%s", s + 1);
    int len = strlen(s + 1);
    int Max = -1, ans = 0, flag = 1;
    for(int i = 1; i <= len && flag; i++)
    {
        if(s[i] == '0')   
        	a[++ans].push_back(i);
        else
        {
            if(ans == 0)//只有遇到1往上走才可能0不够用
            	flag = 0;
            a[ans--].push_back(i);
        }
        Max = max(Max, ans);
    }
    if(Max != ans)    
    	flag=0;
    if(flag == 0)   
    	puts("-1");
    else
    {
        cout << Max << endl;
        for(int i = 1; i <= Max; i++)
        {
            cout << a[i].size();
            for(int j = 0; j < a[i].size(); j++)
                printf(" %d", a[i][j]);
            cout << endl;
        }
    }
    return 0;
}