Submission #718034

#	Time	Username	Problem	Language	Result	Execution time	Memory
718034		baokhue232005	Newspapers (CEOI21_newspapers)	C++14	8 / 100	1 ms	340 KiB

newspapers

/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
// lethal option

#include<bits/stdc++.h>
using namespace std;

#define all(flg) flg.begin(), flg.end()
#define int long long
#define pb push_back
#define fi first
#define se second
#define endl "\n"
#define eb emplace_back
#define ii pair<int, int>
#define vi vector<int>
#define PI 3.141592653589793238462643383279502884
#define ll long long
#define ld long double
#define for1(i, ff, gg) for(int i = ff; i <= gg; ++i)
#define for2(i, ff, gg) for(int i = ff; i >= gg; --i)
const ll mod = 1e9 + 7;
const int maxN = 100;
const ll oo = 1e18 + 7;
int n, a[maxN];
int m;

int bard[110][110];
int sug[110][110];

signed main(){
    // freopen(".inp", "r", stdin);
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    if(n <= m) {
        cout << "NO\n";
        return 0;
    }
    cout << "YES\n";
    if(n == 1){
        cout << "1\n1";
    }
    else if(n == 2){
        cout << "2\n1 1";
    }
    else{
        cout << 2*n-4 << "\n";
        for(int i = 2; i <= n-1; i++)cout << i << " ";
        for(int i = n-1; i > 1; i--)cout << i << " ";
    }
}

• Subtask 1: 0 / 12
• Subtask 2: 8 / 8
• Subtask 3: 0 / 80