#include <bits/stdc++.h>
using namespace std;
#define int long long
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;
}
if(n==1) cout<<"YES\n"<<"2 1 1"<<"\n";
else
{
cout<<"YES\n"<<n*2-2<<" \n";
for(int i=1; i<n; i++)
{
cout<<i<<" "<<i<<" ";
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
4 |
Partially correct |
1 ms |
320 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
6 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Partially correct |
0 ms |
340 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
1 ms |
232 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
320 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
2 ms |
340 KB |
Failed to provide a successful strategy. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
0 ms |
212 KB |
Provide a successful but not optimal strategy. |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
4 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
5 |
Partially correct |
1 ms |
212 KB |
Provide a successful but not optimal strategy. |
6 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |