Bit strings

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;


int l[N], z[N], a[N];
int c[N];
void solve()
{
    string s;
    cin >> s;

    int m = s.length(), k=0;
    memset(l, 0, sizeof(int)*(m+5));
    memset(z, 0, sizeof(int)*(m+5));
    memset(a, 0, sizeof(int)*(m+5));

    int last = -1;
    for(int i=0; i<m; i++)
    {
        z[i] = z[i-1];
        if(s[i]=='1')
        {
            // in one
            k++;
            l[k] = z[i] - z[last] + 1;
            last = i;
        } else {
            // in zero
            z[i]+=1;
        }
    }
    l[k+1] = z[m-1] - z[last] + 1;

    for(int i=1; i<=k; i++)
    {
        a[0] += c[l[i] - 1];
        for(int j=0; i+j<=k; j++)
            a[j+1] += l[i] * l[i+j+1];
    }
    a[0] += c[l[k+1] - 1];

    for(int i=0; i<=m; i++)
    {
        // all numbers
        cout<<a[i]<<" ";
    }
    cout<<endl;
}


signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int t;
    cin >> t;

    c[1] = 1;
    for(int i=2; i<=1e5; i++)
        c[i] = c[i-1] + i;
    
    while (t--) {
        solve();
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED