#include<iostream>
using namespace std;
int n,m;
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>m;
int a,b;
for(int i=1;i<=m;i++)
{
cin>>a>>b;
}
if(m!=n-1)
{
cout<<"NO\n";
return 0;
}
cout<<"YES\n";
if(n==1)
{
cout<<1<<"\n"<<1;
return 0;
}
if(n<=3)
{
cout<<2<<"\n"<<"2 2";
return 0;
}
if(n==4)
{
cout<<4<<"\n"<<"2 3 3 2";
return 0;
}
if(n%2==1)
{
cout<<2*(n-2)<<"\n";
for(int i=2;i<n;i++)
cout<<i<<" ";
for(int i=n-1;i>1;i--)
cout<<i<<" ";
}
else
{
cout<<2*(n-2)<<"\n";
for(int i=2;i<n;i++)
cout<<i<<" ";
for(int i=n-1;i>1;i--)
cout<<i<<" ";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
600 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
17 |
Correct |
1 ms |
348 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
9 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |