KOICOST - Cost
You are given an undirected graph with N verticies and M edges, where the weights are unique.
There is a function Cost(u, v), which is defined as follows:
While there is a path between vertex u and v, delete the edge with the smallest weight. Cost(u,v) is the sum of the weights of the edges that were deleted in this process.
For example, from the graph above (same as the sample input), Cost(2,6) is 2+3+4+5+6 = 20.
Given an undirected graph, your task is to calculate the sum of Cost(u,v) for all vertices u and v, where u < v. Since the answer can get large, output the answer modulo 10^9.
The first line of the input consists of two integers, N and M. (1 <= N <= 100,000, 0 <= M <= 100,000)
The next M lines consists of three integers, u, v, and w. This means that there is an edge between vertex u and v with weight w. (1 <= u, v <= N, 1 <= w <= 100,000)
Output the sum specified in the problem statement.
Input: 6 7
1 2 10
2 3 2
4 3 5
6 3 15
3 5 4
4 5 3
2 6 6
Even if ur output is wrong on TC1 then also spoj runs it till TC20 so don't assume that u got it wrong on last TC.
Is there anything that using modulo 10^9 obtained a correct answer in all tests?
Interesting question with multiple concepts
Shouldn't the answer to the sample test case be 246 rather than 256?
why the mod part is not mentioned in the question.. :/ take mod 1000000000 before printing the answer
Can someone explain me the sample test case? I can only see 2 path to 2->6 in the sample input . that are
Getting WA on case 20 even with modulo 10^9 :(
if getting wa on case 20 ,becauz mode = 1000000000 not 10e9+7
According to the Merriam-Webster dictionary entry for vertex, vertices and vertexes can be used as the plural of vertex, so verticies is *wrong*.
why i got wa on test20?sad :<