This repository was archived by the owner on Dec 20, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathBOJ11724.java
More file actions
48 lines (40 loc) · 1.32 KB
/
Copy pathBOJ11724.java
File metadata and controls
48 lines (40 loc) · 1.32 KB
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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class BOJ11724 {
static boolean[][] map;
static boolean[] visited;
static int n;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
n = Integer.parseInt(st.nextToken());
int m = Integer.parseInt(st.nextToken());
map = new boolean[n + 1][n + 1];
visited = new boolean[n + 1];
for (int i = 0; i < m; i++) {
st = new StringTokenizer(br.readLine());
int x = Integer.parseInt(st.nextToken());
int y = Integer.parseInt(st.nextToken());
map[x][y] = true;
map[y][x] = true;
}
int answer = 0;
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
dfs(i);
answer++;
}
}
System.out.println(answer);
}
private static void dfs(int x) {
visited[x] = true;
for (int i = 1; i <= n; i++) {
if (map[x][i] && !visited[i]) {
dfs(i);
}
}
}
}