Urkupillit

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <iomanip>
#include <cstdlib>
#include <queue>
#include <unordered_map>

#define uint unsigned int
#define INF 999999999
#define ll long long
#define M 1000000007
#define E 0.0000001
#define N 131072

using namespace std;

int main() {
    ll n, k;
    cin>>n>>k;

    ll v[n];
    for (int i = 0; i < n; i++) v[i] = 0;
    ll p = 0;
    ll t = -1;
    for (ll i = n; i >= 1; i--) {
        if (k) {
            ll x = max(p, n - k - 1);
            v[x] = i;
            while (v[p]) p++;
            k -= n - x - 1;
        } else {
            if (t == -1) t = i + 1;
            while (v[p]) p++;
            v[p] = t - i;
        }
    }

    for (ll i : v) cout<<i<<" ";
    cout<<endl;

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED