This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
if(n==2){
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<<" ";
}
return 0;
}
else{
cout<<2*(n-2)<<endl;
for(int i = 1; i<n-1; i++){
cout<<i+1<<" ";
}
for(int i = n-2; i>=1; i--){
cout<<i+1<<" ";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |