| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 528091 | aris12345678 | Wand (COCI19_wand) | C++14 | 30 ms | 4908 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;
const int mxN = 1e5+5;
vector<int> adj[mxN];
bool vis[mxN];
void dfs(int u) {
    for(auto &v : adj[u]) {
        if(vis[v]) continue;
        vis[v] = true;
        dfs(v);
    }
}
int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    for(int i = 0; i < m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
        adj[b-1].push_back(a-1);
    }
    string s = "";
    dfs(0);
    // if(adj[0].empty())
    //     vis[0] = true;
    for(int i = 0; i < n; i++) {
        if(vis[i])
            s += '1';
        else
            s += '0';
    }
    cout << s << "\n";
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
