Submission #947893

#TimeUsernameProblemLanguageResultExecution timeMemory
947893Darren0724Newspapers (CEOI21_newspapers)C++17
8 / 100
7 ms11440 KiB
#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;
vector<int> adj[N],vis(N),a[N];

void dfs(int k,int pa){

    vis[k]=1;
    for(int j:adj[k]){
        if(j==pa)continue;
        dfs(j,k);
        
    }

}
int32_t main() {
    LCBorz;
    int n,m;cin>>n>>m;
    if(m>=n){
        cout<<"NO"<<endl;
        return 0;
    }
    cout<<"YES"<<endl;
    if(n==1){
        cout<<"1\n1\n";
        return 0;
    }
    if(n==2){
        cout<<"2\n1 1\n";
        return 0;
    }
    cout<<n*2-4<<endl;
    for(int i=2;i<n;i++){
        cout<<i<<' ';
    }
    for(int i=n-1;i>1;i--){
        cout<<i<<' ';
    }
    cout<<endl;
    

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...