#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> adj[1005], vis(1005);
int flag=1;
void dfs(int x, int y)
{
vis[x]=1;
for(auto i: adj[x])
{
if(i==y) continue;
else if(vis[i]) flag=0;
else dfs(i, x);
}
}
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
int n, m; cin>>n>>m;
for(int i=0; i<m; i++)
{
int x, y; cin>>x>>y;
adj[x].push_back(y);
adj[y].push_back(x);
}
dfs(1, 0);
if(flag==0) cout<<"NO\n";
else
{
cout<<"YES\n"<<n<<"2 1 1\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Integer parameter [name=k] equals to 12, violates the range [1, 5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Integer parameter [name=k] equals to 12, violates the range [1, 5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Integer parameter [name=k] equals to 12, violates the range [1, 5] |
2 |
Halted |
0 ms |
0 KB |
- |