Submission #104667

#TimeUsernameProblemLanguageResultExecution timeMemory
104667leonardaWand (COCI19_wand)C++14
70 / 70
75 ms4860 KiB
#include<bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define F first #define S second typedef pair<int, int> pi; typedef long long int lint; const int inf = 0x3f3f3f3f; const int maxn = 1e5 + 5; int n, m, out1; vector<int> v[maxn]; bool moze[maxn]; bool memo[maxn]; void solve(int x) { if(v[x].empty() or memo[x]) return; memo[x] = 1; for(int i = 0; i < v[x].size(); ++i) { moze[v[x][i]] = 1; solve(v[x][i]); } return; } int main () { ios::sync_with_stdio(0); cin >> n >> m; for(int i = 0; i < m; ++i) { int x, y; cin >> x >> y; if(y == 1) ++out1; v[y - 1].pb(x - 1); } if(out1 == 0) { cout << 1; for(int i = 1; i < n; ++i) cout << 0; return 0; } solve(0); for(int i = 0; i < n; ++i) cout << moze[i]; return 0; } //written and directed by pcelicamaja

Compilation message (stderr)

wand.cpp: In function 'void solve(int)':
wand.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v[x].size(); ++i) {
                 ~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...