#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
const int MAX_N = 1e3;
vector<int> adj[MAX_N];
signed main(){
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n, m;
cin>>n>>m;
cout<<"YES"<<endl;
if(n==1){
cout<<1<<endl;
cout<<1<<endl;
return 0;
}
cout<<2*(n-1)<<endl;
for(int i = 0; i<n-1; i++){
cout<<i+1<<" ";
}
for(int i = n-2; i>=0; i--){
cout<<i+1<<" ";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Partially correct |
0 ms |
364 KB |
Provide a successful but not optimal strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 6 |
Partially correct |
1 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 7 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 8 |
Partially correct |
1 ms |
344 KB |
Provide a successful but not optimal strategy. |
| 9 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 10 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 11 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 12 |
Partially correct |
1 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 13 |
Partially correct |
1 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 14 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 15 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 16 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 17 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 18 |
Partially correct |
1 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 19 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 20 |
Partially correct |
1 ms |
344 KB |
Provide a successful but not optimal strategy. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Partially correct |
0 ms |
364 KB |
Provide a successful but not optimal strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Provide a successful but not optimal strategy. |
| 6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
