Submission #673554

#TimeUsernameProblemLanguageResultExecution timeMemory
673554quocnguyen1012Newspapers (CEOI21_newspapers)C++14
4 / 100
1 ms340 KiB
#include "bits/stdc++.h" using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int N, M; cin >> N >> M; vector<vector<int>> adj(N); for (int i = 0; i < M; ++i) { int u, v; cin >> u >> v; --u; --v; adj[u].emplace_back(v); adj[v].emplace_back(u); } bool exist_cycle = false; vector<bool> visited(N, false); auto dfs = [&](auto&dfs, int u, int p) -> void { visited[u] = true; for (int v : adj[u]) { if (v == p) continue; if (visited[v]) exist_cycle = true; else dfs(dfs, v, u); } }; dfs(dfs, 0, -1); if (exist_cycle) return cout << "NO", 0; cout << "YES\n" << N << '\n'; for (int i = 1; i <= N; ++i) cout << i << ' '; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...