-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q11724.java
65 lines (55 loc) · 1.6 KB
/
Q11724.java
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
package forRank;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class Q11724 {
private static boolean visited[];
private static int N;
private static ArrayList<Integer> map[];
private static int counter = 0;
private static void solve(){
for (int i = 1; i <= N; i++) {
if(!visited[i]){
counter++;
if(map[i].size() > 0)
dfs(i);
}
}
}
private static void dfs(int v){
if(!visited[v]){
visited[v] = true;
for (int i = 0; i < map[v].size(); i++) {
int next = map[v].get(i);
if(!visited[next])
dfs(next);
}
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken()); //Á¤Á¡ÀÇ ¼ö
int M = Integer.parseInt(st.nextToken()); //°£¼±ÀÇ ¼ö
visited = new boolean[N + 1];
map = new ArrayList[N + 1];
for (int i = 1; i <= N; i++)
map[i] = new ArrayList<Integer>();
for (int i = 0; i < M; i++) {
st = new StringTokenizer(br.readLine());
int start = Integer.parseInt(st.nextToken());
int end = Integer.parseInt(st.nextToken());
map[start].add(end);
map[end].add(start);
}
solve();
bw.write(counter + "\n");
br.close();
bw.close();
}
}