| Title |
User |
Message |
Date Posted |
| Re: Test cases updated |
XZNZ |
ty for info |
Dec 25, 2011 - 4:05:46 am UTC |
| ... |
DFist |
so basically find the dis and the shortest one is eaten right? |
Dec 25, 2011 - 3:22:19 am UTC |
| Re: brute-force |
bbi5291 |
The coyote isn't restricted to entering at integer x-coordinates, though, it could enter at a point like 577.215665. You could obtain a better approximation by taking smaller steps (like 0.01, 0.02, 0... |
Dec 31, 2008 - 11:46:06 pm UTC |
| brute-force |
seyonv |
Couldn't we just find the distance from every sheep to every point from 1-1000 and check the smallest in each of them or would that time out? |
Dec 31, 2008 - 11:42:17 pm UTC |
| Re: When (as an example) would the x coordinate matter |
hansonw1 |
Just try two random points with a similar y-coordinate. For example, (0, 10) and (1000, 11). Obviously if the wolf comes in at coordinate 0 it's going to eat the first one, but if it comes in at coor... |
Dec 31, 2008 - 9:37:46 pm UTC |
| Re: When (as an example) would the x coordinate matter |
bbi5291 |
No, no, that's not it. Assume that the coyote enters randomly at some point on the fence. Then the coyote finds the sheep closest to its current location. In other words, a sheep can be eaten if ther... |
Dec 31, 2008 - 9:31:34 pm UTC |
| Re: When (as an example) would the x coordinate matter |
Bob |
But then, since it could choose any spot, how would the x co-ordinate be of any use? Besides the fact that they are ON the fence ... |
Dec 31, 2008 - 9:15:42 pm UTC |
| Re: When (as an example) would the x coordinate matter |
bbi5291 |
The problem statement is not always easy to understand. What it is saying is that the coyote may choose any point on the fence, and then it locates the closest sheep to its current location. |
Dec 31, 2008 - 8:09:02 pm UTC |
| When (as an example) would the x coordinate matter |
Bob |
I can't think of a scenario where the x coordinate would matter for this program. |
Dec 31, 2008 - 6:46:24 pm UTC |
| Test cases updated |
hansonw1 |
The last case is extremely tricky, and has 1000 sheep. Again this will be a 20 point problem, so no points lost. |
Dec 24, 2008 - 9:31:41 pm UTC |
