OJ Board

It's not that the reason because your submissions aren't been judged.
It seems that the judge is down, maybe Runtime Error(SIGSEV) =)
Look at the status:

15765507 -- Received -:--.--- -- 16132 JAVA 3645 -

There is no trick.
I think I can hardly help you posting some input/output sets here.
If your algorithm manage ties correctly, the only thing left to do is to check input reading and reinitialization after each case. Remember you should be careful if you're mixing scanf and gets.

I rewrote my implementation of the Union-Find data structure used by Kruskal Algorithm and I finally got Accepted. I was using a quite quick implementation with path-compression an union by rank, but although I remember testing it throughly it was somewhat faulty. As you say, there is absolutely no ...

As likhan asks, why searching the MST of the graph doesn't solve this problem?
Maybe we misunderstood the problem... Could you give me some reason because it won't work?

I first compute the distance and add a corresponding edge between each pair of outposts. That is, I construct an undirected graph where edge weights are those distances. Then I apply Kruskal algorithm until P-S edges are added and print the weight of the last edge added. With this approach I get WA....

Did you try drawing a decision tree? If you didn

Thank you cytse!
There was a little big error that wasn't shown in my test cases.

I wonder if someone that have already solved this problem could help me. There must be some tricky input or something wrong with my solution. Any help is welcome. [c] #include <stdio.h> #include <search.h> #include <math.h> /* Although the statement says that m and n will be less than 30, they can a...

Posts can't be deleted but edited? uh

If I follow exactly the output specification of the statement I get a PE. The output is in fact pretty simple: Each line of input contains one integer number n. For each line of input output one line either Stan wins. or Ollie wins. I tried removing the dot at the end of each line and also removing ...