Count the Number of Substrings With Dominant Ones

Given a binary string s (length ≤ 4×10^4), count substrings where the number of '1's is at least the square of the number of '0's. Key observation: zeros^2 grows fast, so any qualifying substring has O(√n) zeros, enabling enumeration by zero-count combined with prefix sums or two‑pointer counting for an efficient solution.