# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96699 | nandonathaniel | Wand (COCI19_wand) | C++14 | 56 ms | 5624 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;
vector<int> adj[100005];
bool visited[100005];
void dfs(int node){
for(int i=0;i<adj[node].size();i++){
if(!visited[adj[node][i]]){
visited[adj[node][i]]=true;
dfs(adj[node][i]);
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,m,x,y;
cin >> n >> m;
for(int i=1;i<=m;i++){
cin >> x >> y;
adj[y].push_back(x);
}
dfs(1);
bool stat=false;
for(int i=1;i<=n;i++){
if(visited[i])stat=true;
}
if(!stat){
visited[1]=true;
}
for(int i=1;i<=n;i++){
if(visited[i])cout << 1;
else cout << 0;
}
cout << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |