908-Re-connecting Computer Sites

[calicratis19]

i m surprised abt the problem. it is said that it will give n-1<=m<=n*n-1/2 ,here m is the number of edges and n is the numbner of node which can be 1 <= n <= 1000000. so clearly m edges cant be stored in an array. but surprisingly there is no input where m>n.a two dimensional array of array[1000020][3] is enough to store edges and cost.

[Jehad Uddin]

In uva there are problems(such as 200,11042,935,(789,479 no test case )) of poor test cases , and this problem is also that type, the problem descripton is wrong also,

[Shafaet_du]

Whats wrong with problem description? just add the costs of first N-1 inputs,and thats the first output. find MST of last K+M inputs,thats the 2nd output.

[SyFyKid]

Nothing wrong, but we should remember that second line (aka MST of K+M edges) should be min(cost_before, cost_after).

Whats wrong with problem description? just add the costs of first N-1 inputs,and thats the first output. find MST of last K+M inputs,thats the 2nd output.

[VitezVojko]

Code: Select all

AC, Blank lines were the problem :S


I simply don't know, what am i doing wrong here, can someone please help me, or give me tricky I/O?