OJ Board

Sorry, it was me

hi, Dreamer#1!
It was my post. Although I knew it was euclidean distance but I've kept getting WA since the contest. I was here for some hint on where could be wrong but only to find your post. Since you've got AC, can you post some input/output here?

He is right. Your cv should have size 1001
By the way, when I submit your code, it gets TLE
And I see no point to use Floyd. You can solve the problem in O(E) time

Maybe you can post your code here or send it to me liux@qilongzhu.com

Hi !
Your algo is right.
Try this out:
1
5
1 10
10 20
20 30
30 40
40 1
Make sure your program doesn't report "some beads may be lost"

I first convert (s1,s2,s3) to (s1-s3,s2-s3), then I find the convex hull and determine wether (0,0) is within this convex hull
But my code is rejected as WA. My code for finding convex hull && checking Point in Polygon has been tested on other problems so they should be ok
Can anyone give me a hint ...

OK...Now I get passed. Thank all of you for your advices
I used simulation and it's much quicker than the math way metioned above, which involves too many wasted multiplications with 0

:wink: I've been working on problem 10625, GNU's Not Unix.
I have tried my best to let my program passed by the judge, but always it says I've got the wrong answer. (Also put a 64 bit structure in cos the problem states that the output data will be contained in a 64-bit int). I wonder if there is ...