[URI ONLINE JUDGE] – 1152 – 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 feelsafe, 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

The input file contains several test cases. Each test case starts with two numbers m (1 ≤ m ≤ 200000) andn (m-1 ≤ n ≤ 200000), that are the number of junctions in Byteland and the number of roads in Byteland, respectively. Follow n integer triples x, y, z, specifying that there will be a bidirectional road between xand y with length z meters (0 ≤ x, y < m and xy).

The input is terminated by m=n=0. The graph specified by each test case is connected. The total length of all roads in each test case is less than 231.

Output

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

Sample Input Sample Output
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
51

my solution:


#include <stdio.h>
#include <string>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#define N 200000

int custo;
int father[N];

struct Grafo {
int x, y, v;
};

Grafo grafo[N];

int cmp(const void *a, const void *b)
{
return (*(struct Grafo *)a).v - (*(struct Grafo *)b).v;
}

void Makeset(int n)
{
int i;
for (i = 0; i <= n; ++i)
{
father[i] = i;
}
}

int Find(int x)
{
if (father[x] != x)
{
father[x] = Find(father[x]);
}
return father[x];
}

int Merge(int x, int y, int p)
{
int i, j;
i = Find(x);
j = Find(y);
if (i != j)
{
custo -= grafo[p].v;
if (i > j)
{
father[i] = j;
}
else
{
father[j] = i;
}
return 1;
}
return 0;
}

int main(){
int m, n;
int i;

while(1){
scanf("%d %d", &m, &n);
if(m == 0 && n == 0) break;
memset(&grafo, 0, sizeof(grafo));
i = 0;
custo = 0;
while(i < n){
scanf("%d %d %d",&grafo[i].x, &grafo[i].y, &grafo[i].v);
custo += grafo[i].v;
i++;
}
Makeset(m);
qsort(grafo, n, sizeof(grafo[0]), cmp);
for (i = 0; i < n; ++i)
{
Merge(grafo[i].x, grafo[i].y, i);
}
printf("%d\n",custo);
}
return 0;
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s