-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBOJ_18352.java
More file actions
57 lines (42 loc) · 1.57 KB
/
Copy pathBOJ_18352.java
File metadata and controls
57 lines (42 loc) · 1.57 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
49
50
51
52
53
54
55
56
57
import java.io.*;
import java.util.*;
public class BOJ_18352 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
StringBuilder sb = new StringBuilder();
int n = Integer.parseInt(st.nextToken());
int m = Integer.parseInt(st.nextToken());
int k = Integer.parseInt(st.nextToken());
int x = Integer.parseInt(st.nextToken());
List<Integer>[] list = new ArrayList[n+1];
for(int i = 0; i <= n; i++) {
list[i] = new ArrayList<>();
}
for(int i = 0; i < m; i++) {
st = new StringTokenizer(br.readLine());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
list[a].add(b);
}
int[] answer = new int[n+1];
Arrays.fill(answer, Integer.MAX_VALUE);
Deque<Integer> q = new ArrayDeque<>();
answer[x] = 0;
q.add(x);
while(!q.isEmpty()) {
int cur = q.poll();
for(int next : list[cur]) {
if(answer[next] < answer[cur]+1) continue;
answer[next] = answer[cur] + 1;
q.add(next);
}
}
// System.out.println(Arrays.toString(answer));
for(int i = 1; i <= n; i++) {
if(answer[i] == k) sb.append(i).append("\n");
}
if(sb.length() == 0) System.out.println(-1);
else System.out.println(sb);
}
}