OJ Board

Posted: **Sun Oct 27, 2002 8:52 pm**

How to solve 10385

Posted: **Sun Oct 27, 2002 9:03 pm**

how about brute force?

Posted: **Sun Jan 19, 2003 5:18 am**

I was doing 10385, then i found something that i need to know
The speed of the contestants is km/h, m/s ??
Without this my algo cannot know the answer.

thanks in advance if someone can tell me

Posted: **Sun Jan 19, 2003 6:07 am**

Km. / H
BTW, i did a mistake in my implementation which got me shock and got me confused about if it was Km/H.

Posted: **Tue Jan 28, 2003 12:48 am**

Any hints on how to avoid problems with rounding ? I can barely obtain the given answers and then only if I make some assumptions about rounding. If I try to be more accurate then the sample answer appears to be incorrect as it appears to be closer to 14.2839 or 14.28 and yet the answer given is 14.29.......

Posted: **Tue Jan 28, 2003 12:57 am**

nevermind....... was just my miscomputations........

Posted: **Mon Sep 07, 2009 7:25 pm**

What's the output for this?

Code: Select all

Posted: **Mon Sep 07, 2009 9:56 pm**

Hi serur.

I checked with assert that n is greater than 1.

Input:

Code: Select all

My output:

Code: Select all

The cheater can win by 2099 seconds with r = 7.00km and k = 0.00km.
The cheater can win by 1270 seconds with r = 21.53km and k = 78.47km.

Hope it helps.

Posted: **Tue Sep 08, 2009 8:47 pm**

Thanks coze. This is my source code, it gets WA. What I did is a ternary search...

Code: Select all

CUT AFTER AC

Posted: **Wed Sep 09, 2009 5:26 pm**

Try using "%.0lf" instead of "%d".

Code: Select all

printf("The cheater can win by %.0lf seconds with r = %.2lfkm and k = %.2lfkm.\n",
       (f(left)),left,total-left);

Posted: **Sat Sep 12, 2009 8:36 pm**

Thanks coze, your suggestion was the very thing. Got it AC at last

Posted: **Thu Sep 24, 2009 2:10 am**

what is the output for

Code: Select all

Posted: **Thu Sep 24, 2009 5:45 pm**

got accepted, it seems that no case on the judge similar to that one

Posted: **Sun May 30, 2010 5:43 pm**

Remember to set precision to 0.001 if using ternary search! Caused me lots of headaches.

Posted: **Fri Jun 25, 2010 7:49 am**

Can someone the idea behind this ternary search solution?

Indeed, I really couldn't figure out how to solve this. I think something related to linear programming would do the job, but i looks like there are much simpler solutions than any using this kind of thing...

So, please, explain me your ideas.

Best regards,
Douglas

OJ Board

10385 - Duathlon

10385 - Duathlon

10385: POOR description

I can answer my question..

Re: 10385 - Duathlon

Re: 10385 - Duathlon

Re: 10385 - Duathlon

Re: 10385 - Duathlon

Re: 10385 - Duathlon

Re: 10385 - Duathlon

Re: 10385 - Duathlon

Re: 10385 - Duathlon

Re: 10385 - Duathlon