OJ Board

Are you allowed to run over the destination square without green touching it and count it as an action, or is the destination square forbidden until you get the green on it?

Also,
i have confirmed what someone else posted above:

::WARNING:: THERE ARE, IN FACT, MULTIPLE DESTINATION SQUARES. How ...

You know, I see a lot of people making crazy modifications for "flood fill" algorithms. Another easy way to do this problem is union find. AC in 0.012 seconds :).

Pro tip: in general, the longest path between two vertices of a graph is NP-Complete. What properties of this graph make it so the ...

Despite the fact that the first few posts suggest you need a newline after your last line, UVa has fixed it! Print a blank line *only* between test cases, otherwise you won't get an AC. However, terminating the last line is okay, i.e.

okay >> "0.00\n" << okay
WRONG >> "0.00\n\n" << WRONG

Also, if ...

Hi all, can anyone please post some more test cases that might break programs? I can't seem to break my algorithm, but it gets W.A. I have used every test case on the forum so far, as well as test cases I've written on my own, and all the samples.

If you're interested in my code, specifically ...

Would anybody be so kind as to tell me where my code starts setting things to zero? I have identified that the line of code causing me to repeatedly get Runtime Error is the following:


numTrips = numTourists / maxPossibleBandwidth;


I'm using a modified Floy-Warshall/Roy-Floyd/WFI algorithm ...