Submission #1047580

#TimeUsernameProblemLanguageResultExecution timeMemory
104758012345678Newspapers (CEOI21_newspapers)C++17
4 / 100
1 ms604 KiB
#include <bits/stdc++.h> using namespace std; const int nx=1e3+5; int n, m, u, v, dsu[nx], f; int find(int x) { if (dsu[x]==x) return x; return dsu[x]=find(dsu[x]); } int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>m; for (int i=1; i<=n; i++) dsu[i]=i; for (int i=1; i<=m; i++) { cin>>u>>v; if (find(u)==find(v)) f=1; dsu[find(u)]=find(v); } if (f) cout<<"NO"; else { cout<<"YES\n"; cout<<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...