Skip to content

도시 분할 계획_준호 #61

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Lanvizu merged 2 commits into from
Jan 23, 2024
Merged

도시 분할 계획_준호 #61

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
65c5ae3
Merge pull request #60 from SMCodingStudy/main
Lanvizu Jan 23, 2024
6a73c2d
도시 분할 계획_준호
Lanvizu Jan 23, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
84 changes: 84 additions & 0 deletions 이코테/10 그래프 이론/도시_분할_계획/준호.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,84 @@
import java.util.*;
class Edge implements Comparable<Edge> {
private int distance;
private int nodeA;
private int nodeB;

public Edge(int distance, int nodeA, int nodeB) {
this.distance = distance;
this.nodeA = nodeA;
this.nodeB = nodeB;
}

public int getDistance() {
return this.distance;
}

public int getNodeA() {
return this.nodeA;
}

public int getNodeB() {
return this.nodeB;
}

@Override
public int compareTo(Edge other) {
if (this.distance < other.distance) {
return -1;
}
return 1;
}
}

public class 도시_분할_계획 {
public static int N, M;
public static int[] parent = new int[100001];
public static ArrayList<Edge> edges = new ArrayList<>();
public static int result = 0;

public static int findParent(int x) {
if (x == parent[x]) return x;
return parent[x] = findParent(parent[x]);
}

public static void unionParent(int a, int b) {
a = findParent(a);
b = findParent(b);
if (a < b) parent[b] = a;
else parent[a] = b;
}

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
N = scanner.nextInt();
M = scanner.nextInt();

for (int i = 0; i <= N; i++) {
parent[i] = i;
}

for (int i = 0; i < M; i++) {
int a = scanner.nextInt();
int b = scanner.nextInt();
int cost = scanner.nextInt();
edges.add(new Edge(cost, a, b));
}

Collections.sort(edges);
int max = 0;

for (Edge edge : edges) {
int cost = edge.getDistance();
int a = edge.getNodeA();
int b = edge.getNodeB();
if (findParent(a) != findParent(b)) {
unionParent(a, b);
result += cost;
max = cost;
}
}
System.out.println(result - max);
// 한 마을의 임의의 두 집을 이은 길이 없는 경우인데 ?
}
}