UVa OJ Board

Is this a travelling salesman problem?
Does any simpler solution exist?

Pier wrote:I keep getting WA. I think it might be because of precision errors (I'm not very used to geometric problems). Any help appreciated.

I think precision is not the case here. Why didn't you put comments to your code, explaining your idea?

I'd consider using knapsack.
http://www.nist.gov/dads/HTML/knapsackProblem.html

Hello, wook! Is your algorithm similar to david's? If it is, then yours should be correct too. You must be very precise, because there should be different punctuation marks in the output: Data set 1: All the lights are visible. // dot here Data set 2: Some lights are not visible: // colon here x = -...

Demonstration: 4-subset of {1, 2, 3, 4, 5, 6}: We start with: 1, 2, 3, 4 1+1 is already here, 2+1 is also, ... but 4+1 is not, so: 1, 2, 3, 5 1, 2, 4, 5 1, 3, 4, 5 2, 3, 4, 5 remember if we upgrade the i-th element y_i to y_i+1, we set everything before it to 1, 2, ... 1, 2, 3, 6 1, 2, 4, 6 1, 3, 4,...

k-subsets of {1, ..., n} Let the first subset be {1, ..., k}. Find the next subset after Y = {y_1, ..., y_k} (where y_1 < ... < y_k) * find the first i, such that y_i+1 not_in Y * increase y_i by 1, set y_j = j for j < i, and return the new set Y * this fails if i=k, y_k = n, in which case Y = {n-k...

What did you use instead of Floyd?
Did you try placing a firestation on every empty intersection and running special-Dijkstra?
Or just used some other all-pairs algorithm and then doing the job...

This algorithms tries to read exactly number_of_intersection lines which describe segments. But any number of road segments can follow. We read (intersection_1, intersection_2, road length) information until we reach an empty line.

Hm... I'm always getting OLE here! That's frustrating!

Hello!
I've recently been working on this problem.
I can't get rid of the P.E. thing.

How many newlines follow the last report?
One, two, three, none?
Does anyone know?

Do they read bboard?

Is there any free source code for judge server system available online? Or some online documentation / book on how to make one?

I can't tell you what's wrong, because you didn't say whait is it supposed to do

Very interesting

Let's talk about judges.
I'm very interested in how judge works. Maybe there already exist some topic in this spacious forum, so I would appreciate some links.
I wonder how does he stop the program when TLE, how are MLE & OLE measured and so on...