Urkupillit

#include <iostream>
#include <cmath>
#include <cstring>

using namespace std;

#define ll long long

int main(int argc, char ** argv) {
	cin.sync_with_stdio(false);

	ll n;
	cin >> n;
	ll k;
	cin >> k;
	if (k < 0) k = 0;
	
	ll * j = new ll[n];
	for (ll i=0;i<n;i++) {
		j[i] = i+1;
	}
	ll f = n-1;
	ll g = 0;
	ll d = n;
	while (k>0) {
		if (k>=(f-g)) {
			memmove(j+g+1,j+g,sizeof(ll)*(f-g));
			j[g] = d;
			f=n-1;
			k-=(f-g);
			d--;
			g++;
		} else {
			ll c = j[f];
			j[f] = j[f-1];
			j[f-1] = c;
			if (f-- == g) {
				f = n-1;
				g++;
				d--;
			}
			k--;
		}
	}
	for (ll i=0;i<n;i++) {
		if (i>0) cout << " ";
		cout << j[i];
	}
	cout << "\n";
	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: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED