oj.uz

Submission #120404

# Submission time Handle Problem Language Result Execution time Memory
120404 2019-06-24T11:30:21 Z FutymyClone Wand (COCI19_wand) C++14
70 / 70
 73 ms 5924 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, m;
vector <int> g[N];
bool visited[N], exist = false;

void dfs (int u) {
    for (auto v: g[u]) {
        if (visited[v]) continue;
        exist = true;
        visited[v] = true;
        dfs(v);
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        g[v].push_back(u);
    }

    dfs(1);
    if (!exist) visited[1] = true;
    for (int i = 1; i <= n; i++) cout << (visited[i] ? 1 : 0);
    return 0;
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 38 ms 5624 KB Output is correct
4 Correct 34 ms 5708 KB Output is correct
5 Correct 73 ms 5628 KB Output is correct
6 Correct 42 ms 5884 KB Output is correct
7 Correct 37 ms 5664 KB Output is correct
8 Correct 35 ms 5820 KB Output is correct
9 Correct 39 ms 5924 KB Output is correct
10 Correct 37 ms 5880 KB Output is correct