#include <bits/stdc++.h>
using namespace std;
int n, m, a, b;
vector<int> w[100005];
bool v[100005];
void dfs(int x){
for (vector<int>::iterator it=w[x].begin();it!=w[x].end();it++){
if (!v[*it]){v[*it] = true; dfs(*it);}
}
return;
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i=0;i<m;i++){
cin >> a >> b;
w[b].push_back(a);
}
dfs(1);
for (int i=1;i<=n;i++) cout << v[i];
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
2688 KB |
Output is correct |
2 |
Correct |
5 ms |
2688 KB |
Output is correct |
3 |
Correct |
60 ms |
5624 KB |
Output is correct |
4 |
Correct |
38 ms |
5624 KB |
Output is correct |
5 |
Correct |
40 ms |
5752 KB |
Output is correct |
6 |
Correct |
45 ms |
5880 KB |
Output is correct |
7 |
Correct |
36 ms |
5624 KB |
Output is correct |
8 |
Correct |
39 ms |
5724 KB |
Output is correct |
9 |
Incorrect |
51 ms |
5880 KB |
Output isn't correct |
10 |
Correct |
57 ms |
5880 KB |
Output is correct |