문제 분석
작성코드
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
| import java.io.*;
import java.util.*;
class Main {
// BFS 방문 배열
public static int[] bfs_visited;
// DFS 방문 배열
public static int[] dfs_visited;
// 인접 리스트
public static List<List<Integer>> list;
// 방문 순서
public static int cnt;
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());
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());
int V = Integer.parseInt(st.nextToken());
// DFS, BFS에 사용할 방문배열 초기화
bfs_visited = new int[N+1];
dfs_visited = new int[N+1];
// 인접리스트 초기화
list = new ArrayList<>();
for(int i=0; i<N+1; i++) {
list.add(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());
list.get(start).add(end);
list.get(end).add(start);
}
for(int i=1; i<list.size(); i++) {
Collections.sort(list.get(i));
}
cnt = 1;
DFS(V);
cnt = 1;
BFS(V);
int[] dfs_list = new int[N];
int[] bfs_list = new int[N];
for(int i=1; i<N+1; i++) {
for(int j=1; j<N+1; j++) {
if(i == dfs_visited[j]) {
dfs_list[i-1] = j;
}
if(i == bfs_visited[j]) {
bfs_list[i-1] = j;
}
}
}
for(int i=0; i<N; i++) {
if(dfs_list[i] != 0) {
bw.write(dfs_list[i] + " ");
}
}
bw.write("\n");
for(int i=0; i<N; i++) {
if(bfs_list[i] != 0) {
bw.write(bfs_list[i] + " ");
}
}
bw.flush();
bw.close();
br.close();
}
private static void DFS(int node) {
if(dfs_visited[node] == 1) {
return;
}
dfs_visited[node] = cnt++;
for(int next : list.get(node)) {
if(dfs_visited[next] == 0) {
DFS(next);
}
}
}
private static void BFS(int node) {
Queue<Integer> q = new LinkedList<>();
q.offer(node);
bfs_visited[node] = cnt++;
while(!q.isEmpty()) {
int now = q.poll();
for(int next : list.get(now)) {
if(bfs_visited[next] != 0) {
continue;
}
q.offer(next);
bfs_visited[next] = cnt++;
}
}
}
}
|
출처
- 해당 문제의 저작권은 문제를 만든이에게 있으며 자세한 내용은 문제 링크에서 참조바랍니다.
