-
Notifications
You must be signed in to change notification settings - Fork 0
/
그래프_14950_정복자.cpp
59 lines (47 loc) · 1.02 KB
/
그래프_14950_정복자.cpp
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
#include <iostream>
#include <algorithm>
using namespace std;
int n, m, c, cnt = 1, result;
struct graph {
int v1, v2, cost;
};
bool cmp(const graph & g1, const graph & g2) {
return g1.cost < g2.cost;
}
graph g[30000];
int check[10001];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> c;
for (int i = 0; i < m; i++)
cin >> g[i].v1 >> g[i].v2 >> g[i].cost;
sort(g, g + m, cmp);
for (int i = 0; i < m; i++) {
if (check[g[i].v1] == 0 && check[g[i].v2] == 0) {
check[g[i].v1] = cnt;
check[g[i].v2] = cnt;
cnt++;
}
else if(check[g[i].v1] == 0 || check[g[i].v2] == 0) {
if (check[g[i].v1])
check[g[i].v2] = check[g[i].v1];
else
check[g[i].v1] = check[g[i].v2];
}
else {
if (check[g[i].v1] == check[g[i].v2])
continue;
else {
// 트리 합치기
int temp = check[g[i].v1];
for (int j = 1; j < n + 1; j++)
if (check[j] == temp)
check[j] = check[g[i].v2];
}
}
result += g[i].cost;
}
cout << result + c * ((n-1) * (n-2) / 2);
}