-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q11403.java
65 lines (55 loc) · 1.51 KB
/
Q11403.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
//cheolyeing_j님 코드를 참고하여 개선
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.StringTokenizer;
public class Q11403 {
private static boolean result[][];
private static boolean isConnected[][];
private static int n;
private static boolean visited[];
private static void solve(){
result = new boolean[n][n];
for (int i = 0; i < n; i++) { //n번만 dfs 실행
visited = new boolean[n];
dfs(i);
result[i] = visited;
}
}
private static void dfs(int start){
for (int i = 0; i < n; i++) {
if(isConnected[start][i] && !visited[i]){
visited[i] = true;
dfs(i);
}
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
n = Integer.parseInt(br.readLine());
isConnected = new boolean[n][n];
for (int i = 0; i < n; i++) {
StringTokenizer st = new StringTokenizer(br.readLine());
for (int j = 0; j < n; j++) {
if(Integer.parseInt(st.nextToken()) == 1)
isConnected[i][j] = true;
}
}
solve();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if(result[i][j])
bw.write("1 ");
else
bw.write("0 ");
}
bw.write("\n");
}
br.close();
bw.close();
}
}