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;
	k = min(k,(n*(n-1))/2);
	if (k>=f) {
		ll m = 0;
		ll q = k;
		while (q >= (f-g)) {
			g++;
			m++;
			q-=(f-g)+1;
		}
		ll * b = new ll[m];
		memmove(b,j+(n-m),sizeof(ll)*m);
		memmove(j+m,j,sizeof(ll)*(n-m));
		//memmove(j,b,sizeof(ll)*m);
		for (int i=0;i<m;i++) {
			j[i] = b[(m-i)-1];
		}
		//j[g] = d;
		f=n-1;
		d-=m;
		k=q;
		//d--;
		//g++;
	}
	if (k>0) {
		memmove(j+(n-k),j+(f-k),sizeof(ll)*k);
		j[f-k] = d;
		k = 0;
	}
	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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED