ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1672. Droid flies

I got Accepted using this approach
Posted by Shen Yang 2 Mar 2017 11:41
divide three euler angle into 50 pieces  each of them is 2*pi/50;enum each euler angles and
compute minmimum max different of distance to three faces.

for(alpha=0;alpha<=2*pi;alpha+=dtheta)
{
     if(min_dist>compute(alpha))
     {
          min_dist=compute(alpha);
          ch=alpha;
     }
}
low=ch-dtheta;
high=ch+dtheta;
then ternary search [low,high]..
Do you understand?
Re: I got Accepted using this approach
Posted by Shen Yang 2 Mar 2017 12:13
hahaha ,15 ms...
Re: I got Accepted using this approach
Posted by Orient 28 Jan 2018 18:16
Can it be solved using QR-decomposition?