Urkupillit

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>

using namespace std;

int main() {
	
	cin.sync_with_stdio(false);
	
	long long n = 0;
	long long k = 0;
	
	cin >> n;
	cin >> k;
	
	vector<long long> pillit;
	
	for (long long i = 1; i <= n; i++) {
		pillit.push_back(i);
	}
	
	long long j = 0;
	long long jmax = 0;

	while (k > n) {
		long long x = pillit[0];
		pillit.erase(pillit.begin());
		pillit.insert(pillit.end() - jmax, x);
		jmax++;
		k -= (n - jmax);
	}

	//for (long long i = 0; i < n; i++) {
	//	cout << pillit[i] << ' ';
	//}
	//cout << '\n';
	
	//cout << k << '\n';

	for (long long i = 0; i < k; i++) {
		
		long long x;
		x = pillit[j];
		pillit[j] = pillit[j + 1];
		pillit[j + 1] = x;
		j++;
		if (j + 1 + jmax == n) {
			j = 0;
			jmax++;
		}
	}
	
	for (long long i = 0; i < n; i++) {
		cout << pillit[i] << ' ';
	}
	
	cout << '\n';
}

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