April lunchtime Triangle Query Help

I have written this solution for subtask 1 but it is giving me WA.
Can someone please help me with some test case where my solution for subtask 1 fails or what should I change in the code?
This is my logic :
As for subtask 1 R[i] - L[i] is constant so I assume it to be equal to 2 * radius and for each point in array I calculate Lmin and Lmax, where for every L in between them an isosceles triangle can be constructed with R = L + 2 * radius s.t. the point lies inside the triangle.