# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100352 | MatesV13 | Wand (COCI19_wand) | C++11 | 60 ms | 5880 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |