Algorithm
Problem Link: https://www.beecrowd.com.br/judge/en/problems/view/1152
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) and n (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 x and y with length z meters (0 ≤ x, y < m and x ≠ y).
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.
| Input Simple | Output Simple |
|
7 11 |
51 |
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
#define sc2(a, b) scanf("%d%d", &a, &b)
#define sc3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define MAX 200000
struct Grafo { int x, y, v; };
int c;
int fat[MAX];
Grafo grafo[MAX];
int cmp(const void *a, const void *b) {
return (*(struct Grafo *)a).v - (*(struct Grafo *)b).v;
}
void makeset(int n) {
for (int i = 0; i < n; i++)
fat[i] = i;
}
int find(int n) {
if(fat[n] != n)
fat[n] = find(fat[n]);
return fat[n];
}
int unionp(int x, int y, int p) {
int i = find(x), j = find(y);
if(i != j) {
c -= grafo[p].v;
if(i > j) fat[i] = j;
else fat[j] = i;
return 1;
}
return 0;
}
int main(int argc, char const *argv[]) {
int m, n, i;
while(sc2(m, n) && (m || n)) {
c = 0;
memset(&grafo, 0, sizeof(grafo));
for (i = 0; i < n; i++) {
sc3(grafo[i].x, grafo[i].y, grafo[i].v);
c += grafo[i].v;
}
makeset(m);
qsort(grafo, n, sizeof(grafo[0]), cmp);
for (i = 0; i < n; ++i)
unionp(grafo[i].x, grafo[i].y, i);
printf("%dn", c>;
}
return 0;
}
Input
Output