OJ Board

cyfra wrote:Here is the example: 1 3

My program 1 0 1
Your program -2 1 1
it is correct, but don't forget about this:

X<=Y and |X|+|Y| is the minimal.

Since 1 > 0 (X>Y), I think "1 0 1" is illegal output.

"-2 1 1" seems right to me (but I'm getting WA on it right now).

Although the problem is extremely sketchy on this (IMO), not only must you not be able to walk outside of the tree shade within the distance you give, you must not be able to walk into the tree (at least that was what I did in order to get AC).

Thus: 5 5 5 11 5
has an output of: 1.000

I do not understand the problem statement for #10064. In particular, what is meant by "his voyage is continuous"? "Never stops anywhere" does not really make sense to me.

Of course, only 8 logins have submitted accepted solutions, so my hopes on hitting on someone is not high. :)