Repository navigation
Expand file tree
/
Copy pathhacking.java
More file actions
63 lines (51 loc) · 1.82 KB
/
Copy pathhacking.java
File metadata and controls
63 lines (51 loc) · 1.82 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
58
59
60
61
62
63
package implementation;
import java.io.*;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class hacking {
static int N, M;
static int[] computerCnt;
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());
M = Integer.parseInt(st.nextToken());
ArrayList<Integer>[] list = new ArrayList[N + 1]; // A -> B로의 경우를 저장할 ArrayList 배열
for (int i = 1; i <= N; i++) {
list[i] = new ArrayList<>();
}
for (int i = 0; i < M; i++) {
st = new StringTokenizer(br.readLine());
int first = Integer.parseInt(st.nextToken());
int second = Integer.parseInt(st.nextToken());
list[first].add(second);
}
computerCnt = new int[N + 1];
int max = Integer.MIN_VALUE;
for (int i = 1; i <= N; i++) {
boolean[] visited = new boolean[N + 1];
dfs_computer(i, visited, list);
}
for (int i = 1; i <= N; i++) {
max = Math.max(max, computerCnt[i]);
}
for (int i = 1; i <= N; i++) {
if (computerCnt[i] == max) {
bw.write(i + " ");
}
}
bw.flush();
bw.close();
br.close();
}
private static void dfs_computer(int i, boolean[] visited, ArrayList<Integer>[] list) {
visited[i] = true;
for (int temp : list[i]) {
if (!visited[temp]) {
computerCnt[temp] += 1;
dfs_computer(temp, visited, list);
}
}
}
}