First, convert each package p = (s1, s2, s3) to a vector (s2 - s1, s3 - s1). All the packages forms convex hull. If point (0, 0) is in this convex hull, then there will be a solution, otherwise not. I can not tell the proof of this now, if you have any ideas, please let me know.
In fact, point (0, 0) is not in this convex hull if and only if all the vectors fall into a sector whose angle is less than PI. This is obviously correct. So we can use this point to get our answer.
BTW, you must care about data overflow. I've got AC after lots of WAs just by change date type from int to long long.