Skip to content

팀 결성_준호 #58

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

팀 결성_준호 #58

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
7de1470
Merge pull request #57 from SMCodingStudy/main
Lanvizu Jan 23, 2024
4745dda
팀 결성_준호
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
49 changes: 49 additions & 0 deletions 이코테/10 그래프 이론/팀_결성/준호.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
import java.util.*;

public class 준호 {
public static int N ,M;
public static int[] parent = new int[100001];

public static int findParent(int x) {
if(parent[x] == 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[a] = b;
} else {
parent[b] = a;
}
}

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;
}

StringBuilder result = new StringBuilder();
for (int i = 0; i < M; i++) {
int a = scanner.nextInt();
int b = scanner.nextInt();
int c = scanner.nextInt();
if (a == 1) {
if (findParent(b) == findParent(c)) {
result.append("YES ");
} else {
result.append("NO ");
}
} else {
unionParent(b, c);
}
}
System.out.println(result);
}
}