Urkupillit

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define fr(o) for(ll z=0; z < o; z++)

ll n, k, big, i, maxinc;

vector<ll> l;

void move(ll x)
{
    l[i + (n-1-x)] = big;
    big--;

    ll dc = 0;

    for(ll j = i+n-1; j != i + (n-1-x); j--)
    {
        l[j] = big - dc;
        dc++;
    }
}

void movemax()
{
    l[i-1] = big;
    i--; big--;
}

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

    i = n-1; big = n; 
    maxinc = n-1;

    l.resize(2*n - 1);

    for(ll z = 1; z < n+1; z++)
    {
        l[n-2 + z] = z;
    }

    while(k != 0)
    {
        if(k < maxinc){
            move(k);
            k = 0;
        }
        else{
            movemax();
            k -= maxinc;
            maxinc--;
        }
    }
    
    for (ll m = i; m < i+n; m++)
    {
        cout << l[m] << " ";
    }
    
    cout << endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER