| Title |
User |
Message |
Place |
Date Posted |
| Re: What if |
hansonw1 |
The judge will accept any shortest route. |
ccc98s3 |
Dec 05, 2008 - 1:51:04 am UTC |
| Hint |
SourSpinach |
This is a graph theory problem that's just asking for the shortest path between 2 nodes, made trickier by the presence of traffic lights. The algorithm to use here is called "Dijkstra's", so you can ... |
traffic |
Dec 05, 2008 - 1:50:07 am UTC |
| Hint |
SourSpinach |
Unfortunately, the only "hint" I can give is that this problem is too hard for most people to get full marks on :( However, I can say that it's a "max-flow" graph theory problem, so you could look up... |
RevDig |
Dec 05, 2008 - 1:48:45 am UTC |
| What if |
StealthAdept |
Suppose that after all moves in the input are done, the lander is at (0,0), and the rover is at (0,10), facing up (facing the opposite direction of the lander). Should the rover turn left twice then m... |
ccc98s3 |
Dec 05, 2008 - 1:46:58 am UTC |
| Re: Re: How do I get TLE??? |
HelloMello |
Heh...Heh... |
p156ex14 |
Dec 04, 2008 - 11:59:55 pm UTC |
| Re: How do I get TLE??? |
hansonw1 |
Where does it say it has to be a -1? It could be any negative number... |
p156ex14 |
Dec 04, 2008 - 11:25:03 pm UTC |
| How do I get TLE??? |
HelloMello |
Is the first test case missing a '-1'? My program at most only does 160 loop executions per test case. There's no way I could have gotten a TLE if the test case is valid...is there? |
p156ex14 |
Dec 04, 2008 - 11:10:03 pm UTC |
| Re: output |
bleung91 |
nop.e that'll get you 40/50 |
ccc00s5 |
Dec 04, 2008 - 4:28:49 pm UTC |
| We don't |
dAedaL |
The coyote can enter at any point along the southern boundary. Your job is to find which sheep may be eaten. I guess it can be viewed that he enters from ALL points along the boundary. |
ccc00s5 |
Dec 04, 2008 - 4:35:28 am UTC |
| postition |
seyonv |
How exactly do we know where along the soutern boundary the coyotes is going to enter? Is it relative to some other factor? |
ccc00s5 |
Dec 04, 2008 - 4:27:17 am UTC |
