It is amasing, but I have AC without using long arithmetics and some advanced math!
Just recurrently solving equations P'(x) = 0 with binary search for polynomial roots between stationary points taking into account multiplicity of roots on each step.
C++ double is enough! with epsilon = 1e-12.
BTW. epsilon = 1e-9 give WA_35...