Getting TLE while doing binary search on segment tree

Revision en1, by haiender288, 2022-08-11 20:10:00

The problem that I'm doing: 1548B - Integers Have Friends

My submission: 167895313

Basically what I'm doing is finding the maximum length of the subarray in the "diff" array, where their GCD is greater than or equal to 2. I made a GCD segment tree and consider for every index i, I will binary search the greatest j where gcd(diff[i..j]) >= 2. The time complexity of this algorithm should be O(n log^2 n), but I got TLE (5 times with the same code). Is there anything that I'm missing? Thanks in advance.

Tags segment tree, gcd, binary search


  Rev. Lang. By When Δ Comment
en1 English haiender288 2022-08-11 20:10:00 566 Initial revision (published)