#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<int> g[1005];
bool viz[1005];
int lol,cur;
int deg[1005];
void dfs(int nod)
{
viz[nod] = true;
cur++;
for (auto vecin : g[nod])
if (!viz[vecin])
dfs(vecin);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
for (int i = 1; i <= m; i++)
{
int x,y;
cin >> x >> y;
deg[x]++;
deg[y]++;
g[x].push_back(y);
g[y].push_back(x);
}
cout << "YES\n0";
return 0;
for (int i = 1; i <= n; i++)
{
if (!viz[i])
{
cur = 0;
dfs(i);
lol += cur - 1;
}
}
if (lol != m)
{
cout << "NO";
return 0;
}
for (int i = 1; i <= n; i++)
{
for (auto j : g[i])
{
if (deg[i] >= 2 and deg[j] >= 2)
{
cout << "NO";
return 0;
}
}
}
cout << "YES\n";
vector<int> nod0;
vector<int> deggr;
for (int i = 1; i <= n; i++)
if (deg[i] == 0)
nod0.push_back(i);
for (int i = 1; i <= n; i++)
{
if (deg[i] >= 2)
{
nod0.push_back(i),nod0.push_back(i);
}
}
for (int i = 1; i <= n; i++)
{
if (deg[i] == 1 and deg[g[i][0]] == 1 and g[i][0] > i)
nod0.push_back(i),nod0.push_back(i);
}
cout << (int)nod0.size() << '\n';
for (auto it : nod0)
cout << it << ' ';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Integer parameter [name=k] equals to 0, violates the range [1, 5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Integer parameter [name=k] equals to 0, violates the range [1, 5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Integer parameter [name=k] equals to 0, violates the range [1, 5] |
2 |
Halted |
0 ms |
0 KB |
- |