Educational Codeforces Round 72 C. The Number Of Good Substrings

最新推荐文章于 2024-11-05 21:58:11 发布

Cythia-1

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量722

点赞数 8

分类专栏： c++刷题记录文章标签： c语言算法数据结构 c++ Codeforces

本文链接：https://blog.csdn.net/m0_69367351/article/details/139328561

版权

c++刷题记录专栏收录该内容

52 篇文章 0 订阅

订阅专栏

The Number Of Good Substrings

time limit per test: 4 second memory limit per test: 256 megabytes input: standard input output: standard output

You are given a binary string $s$ (recall that a string is binary if each character is either $0$ or $1$ ).

Let $f (t)$ be the decimal representation of integer $t$ written in binary form (possibly with leading zeroes). For example $f (011) = 3, f (00101) = 5, f (00001) = 1, f (10) = 2, f (000) = 0$ and $f (000100) = 4$ .

The substring $s_{l}, s_{l+1}, \dots , s_{r}$ is good if $f(s_l \dots s_r)$ .

For example string $s = 1011$ has $5$ good substrings: $s_1 \dots s_1 = 1$ , $s_3 \dots s_3 = 1$ , $s_4 \dots s_4 = 1$ , $s_1 \dots s_2 = 10$ and $s_2 \dots s_4 = 011$ .

Your task is to calculate the number of good substrings of string $s$ .

You have to answer $t$ independent queries.

Input

The first line contains one integer $t$ ( $\le t \le 1000$ ) — the number of queries.

The only line of each query contains string $s$ ( $\le |s| \le 2 \cdot 10^5$ ), consisting of only digits $0$ and $1$ .

It is guaranteed that $\sum\limits_{i=1}^{t} |s_i| \le 2 \cdot 10^5$ .

Output

For each query print one integer — the number of good substrings of string $s$ .

Example

$\tt input$
4 0110 0101 00001000 0001000
$\tt output$
4 3 4 3

Tutorial

由题意得字符串 $s$ 的长度最长为 $\cdot 10 ^ 5$ ，所以只需要判断最长为 $18$ 的子字符串即可，由于前导零不会对数产生影响，因此我们可以用前导零凑数，如果当前长度加上前导零的长度大于当前可以表示的数，那么一定可以是一个 $\tt good substrings$

此解法时间复杂度为 $\mathcal O(n\log n)$

Solution

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

#define endl '\n'
#define int long long

void solve() {
    int ans = 0;
    string s;
    cin >> s;
    vector<int> pre(s.size() + 1);
    for (int i = 0; i < s.size(); ++i) {
        if (s[i] == '0') {
            pre[i + 1] = pre[i] + 1;
        }
    }
    for (int r = 0; r < s.size(); ++r) {
        int mid = 0;
        for (int l = r; ~l and r - l < 19; --l) {
            if (s[l] == '0') {
                continue;
            }
            mid |= 1 << (r - l);
            if (mid <= r - l + 1 + pre[l]) {
                ++ans;
            }
        }
    }
    cout << ans << endl;
}

signed main() {
    int Test; cin >> Test; while (Test--)
    solve();
    return 0;
}