This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |