I've been trying to solve this problem for a week. My best achievement is ML (and almost TL) on test 19.
Tell me, please, am right with my algo or there is something more effective.

My algo is recursive. For current parallelepiped I find any point that is inside it. Then I divide the parallelepiped on parts with three plane parallel to coordinate plane consicutively. So, for each parallelepiped there is 6 recursive calls of my function.

This is a brute force but I use different improvements (hash, DP, "bits arithmetics") to make my program faster.

Please, tell me am I right or I should look for another way of solving this problem.

Thanks.

Edited by author 19.06.2005 16:44