ULM09 - Dark roads

Economic times these days are tough, even in Byteland. To reduce the operating costs, the government of Byteland has decided to optimize the road lighting. Till now every road was illuminated all night long, which costs 1 Bytelandian Dollar per meter and day. To save money, they decided to no longer illuminate every road, but to switch off the road lighting of some streets. To make sure that the inhabitants of Byteland still feel safe, they want to optimize the lighting in such a way, that after darkening some streets at night, there will still be at least one illuminated path from every junction in Byteland to every other junction.

What is the maximum daily amount of money the government of Byteland can save, without making their inhabitants feel unsafe?

Input Specification

The input file contains several test cases. Each test case starts with two numbers m and n, the number of junctions in Byteland and the number of roads in Byteland, respectively. Input is terminated by m=n=0. Otherwise, 1 ≤ m ≤ 200000 and m-1 ≤ n ≤ 200000. Then follow n integer triples x, y, z specifying that there will be a bidirectional road between x and y with length z meters (0 ≤ x, y < m and x ≠ y). The graph specified by each test case is connected. The total length of all roads in each test case is less than 231.

Output Specification

For each test case print one line containing the maximum daily amount the government can save.

Sample Input

7 11
0 1 7
0 3 5
1 2 8
1 3 9
1 4 7
2 4 5
3 4 15
3 5 6
4 5 8
4 6 9
5 6 11
0 0

Sample Output


hide comments
flyingduchman_: 2016-12-29 04:01:58

Prim's mst for adjacency list in c++. ac in 0.06s.

sumbayak_ae: 2016-12-20 20:22:19

weak test case.
forgot to change array size to 200000 but still accepted :p

codemotto: 2016-10-11 12:51:01

AC in one go

Gaurav Dahima: 2016-09-13 13:37:56

easy peasy :D

vipin475_: 2016-08-20 19:36:46

compress the paaaa...

puneethnaik: 2016-07-12 19:47:39

easy one !!! good to sharpen implementation skill!

Brett Fazio: 2016-03-16 15:54:09

AC 1st go. 10^34 solve.

Kyle Dencker: 2016-03-15 16:39:16

Easy Problem, only took me 4 attempts. Like a boss!

FYI: Java you need a BufferedReader AND a PrintWriter.

Added by:abdelkarim
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:2009/2010 ACM International Collegiate Programming Contest University of Ulm Local Contest