OJ Board

I see lots of other submissions being judged properly, but I can never get mine judged. Is there any reason why some submissions can be judged but not others?

I am getting submission error on 1033. When I submit a "Hello World" program I get WA quickly as expected. When I submit my real attempt, the submission shows up as "Running" for a long time (as much as 10 minutes?) and eventually became "Submission Error". Any idea?

Are there any tricky cases? I kept getting WA and there are very few accepted. What should one do if they give a control center with 0 planes controlled? Is it automatically impossible (since the circle is supposed to be defined by the farthest plane controlled)? For tie-breaking, what if the northe...

Thanks, I have solved it now. I thought that 1 2 and 2 1 both appearing means that somehow they are formed into a loop.

My code passes the posted I/O but got WA. With asserts I confirmed that some pairs are included in the input multiple times. My algorithm is essentially the same as the one posted above. What exactly are we supposed to do if we see an edge twice? Sample case 5 seems clear, but what if the same pair ...

Hi,

I have submitted a few solutions to 10004, 10047, and 11228. They were all judged and I got "failed" with a blank judgement. What does that mean?

Still not judging this problem? I sent my code in and it is just stuck at "Sent to judge".

I have tested my program on the "official test data" and it is working on my machine.

Actually I used a slightly different algorithm and I did not deal with the case when the line cut through a vertex instead of a single edge. I got accepted after fixing that.

Any hints? I think I am using the correct algorithm (the same as what has been posted) and my output matches all of jan's output. Still WA.

howardcheng wrote:I build exactly the graph that you say and run my own Dijkstra algorithm for each query, but it always runs too long. Is there some way to optimize it so that Dijkstra only has to be run once?

Never mind. I got under the time limit by using vectors instead of list in STL.

I build exactly the graph that you say and run my own Dijkstra algorithm for each query, but it always runs too long. Is there some way to optimize it so that Dijkstra only has to be run once?

It looks like there are cases in which M > 100, violating the problem statement.

I submitted something to the new icpclive online judge (problem 4981) twice. When I looked "My submissions", the verdict column is blank. What does that mean?

Any hints? My code appears to pass all the cases posted here, and I am reading/printing the input as a string. Are there more tricky cases?

you can also use a suffix array/tree.