I hava an array of size at max 100000.
I need find all subarrays whose GCD is x .
How can I do it efficiently ? Please help ..
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Name |
---|
Key observation is to notice that gcd is monotonic. (meaning if the gcd of elements between i to j is y, then the gcd of elements i to j+1 will be <= y.)
Then for each i from 1 to n, u can binary search for the rightmost index more than i (let's say j, such that the gcd of elements between i to j is <= x), after that, binary search for the leftmost index more than i (let's say k, such that the gcd of elements between i to k is >= x).
Then the number of subarrays with gcd of x starting from i = j-k+1.
And gcd from elements between i to j can be calculated in O(1) with sparse table.
Thus resulting complexity will be n * log2(n)
A similar question can be found here: https://dunjudge.me/analysis/problems/1121/
Thank You .