# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528092 | 2022-02-19T08:25:53 Z | aris12345678 | Wand (COCI19_wand) | C++14 | 40 ms | 4864 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2636 KB | Output is correct |
2 | Correct | 1 ms | 2636 KB | Output is correct |
3 | Correct | 25 ms | 4788 KB | Output is correct |
4 | Correct | 27 ms | 4752 KB | Output is correct |
5 | Correct | 26 ms | 4772 KB | Output is correct |
6 | Correct | 28 ms | 4804 KB | Output is correct |
7 | Correct | 27 ms | 4716 KB | Output is correct |
8 | Correct | 27 ms | 4804 KB | Output is correct |
9 | Correct | 40 ms | 4824 KB | Output is correct |
10 | Correct | 29 ms | 4864 KB | Output is correct |