-
Notifications
You must be signed in to change notification settings - Fork 1
/
11403.cpp
41 lines (36 loc) · 780 Bytes
/
11403.cpp
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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void dfs(int x, vector<int> adj[], vector<bool> &visited) {
for (int i=0; i<adj[x].size(); i++) {
int nxt = adj[x][i];
if (visited[nxt]) continue;
visited[nxt] = true;
dfs(nxt, adj, visited);
}
}
void solve(void) {
int n; cin >> n;
vector<int> adj[n];
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
int x; cin >> x;
if (x) adj[i].push_back(j);
}
}
for (int i=0; i<n; i++) {
vector<bool> visited(n, false);
dfs(i, adj, visited);
for (int j=0; j<n; j++) {
cout << visited[j] << " ";
}
cout << "\n";
}
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
solve();
return 0;
}