This repository has been archived by the owner on Jun 20, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 33
/
J_Prakhar.c
101 lines (90 loc) · 1.97 KB
/
J_Prakhar.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define edge struct edge
edge{
int u;
int v;
int weight;
};
void merge(edge* arr, int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
edge* L = (edge*)malloc(sizeof(edge) * n1);
edge* R = (edge*)malloc(sizeof(edge) * n2);
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i].weight <= R[j].weight) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(edge* arr, int l, int r)
{
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
int* parent;
int findParent(int node)
{
if(parent[node] == node)
return parent[node];
parent[node] = findParent(parent[node]);
return parent[node];
}
void link(int i , int j)
{
int i_parent = findParent(i);
int j_parent = findParent(j);
parent[j_parent] = i_parent; // parent[i_parent] = j_parent;
}
int main()
{
int n , m;
scanf("%d %d%*c" , &n , &m);
parent = (int*)malloc(sizeof(int) * n);
for(int i = 0 ; i < n ; i++)
parent[i] = i;
edge* graphs = (edge*)malloc(sizeof(edge) * m);
for (int i = 0; i < m; i++)scanf("%d %d %d%*c" ,&graphs[i].u , &graphs[i].v , &graphs[i].weight);
mergeSort(graphs , 0 , m-1);
int ans = 0;
for (int i = 0; i < m; i++)
{
if(findParent(graphs[i].u) == findParent(graphs[i].v))
continue;
else{
ans += graphs[i].weight;
link(graphs[i].u , graphs[i].v);
}
}
printf("%d" , ans);
}