You are given a binary string s.

A substring is said to have dominant ones if the total count of '1's in the substring is greater than or equal to the square of the total count of '0's in that substring.

Return the total number of substrings of s that have dominant ones.

Constraints:

• $1 \leq$ s.length $\leq 4 \times 10^4$

• s consists only of characters '0' and '1'.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.