Aita

#include <iostream>
#include <cmath>
#include <set>
#include <algorithm>
#include <vector>
#include <ctime>        // std::time
#include <cstdlib>      // std::rand, std::srand
 
#define ll long long
#define ull unsigned long long
 
#define pii pair<int, int>
#define pll pair<long long, long long>
 
#define defmod 1000000007
using namespace std;
 
int myrandom (int i) { return std::rand()%i;}
 
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	ll n, k; cin >> n >> k;
	if(n <= 10){
		vector<int> heh;
		for(int i = 0; i < n; i++)
			heh.push_back(i+1);
		do{
			bool okkkkk = true;
			for(int i = 1; i < n; i++){
				if(abs(heh[i]-heh[i-1]) < k)
					okkkkk = false;
			}
 
			if(okkkkk){
				for(int i = 0; i < n; i++){
					cout << heh[i] << " ";
				}
				cout << endl;
				return 0;
			}
			
		}while(next_permutation(heh.begin(), heh.end()));
		cout << "QAQ" << endl;
	}
	ll r[101010] = {0};
	set<int> lo;
	for(int i = 0; i < n; i++)
		lo.insert(i+1);
	r[1] = 1;
	lo.erase(1);
	for(int i = 2; i <= n; i++){
		if(lo.count(r[i-1]+k)){
			r[i] = r[i-1]+k;
			lo.erase(r[i]);
		}
		else if(lo.count(r[i-1]-k)){
			r[i] = r[i-1]-k;
			lo.erase(r[i]);
		}
		else{
			int nn = *(lo.begin());
			if(abs(r[i-1]-nn) < k){
				nn = *(lo.lower_bound(r[i-1]+k));
				if(lo.count(nn) && abs(r[i-1]-nn) >= k){
					r[i] = nn;
					lo.erase(nn);
				}
 
			}
			else{
				r[i] = nn;
				lo.erase(nn);
			}
		}
 
	}
	bool ebin = true;
	r[0] = 99999999999LL;
	r[n+1] = 999999999999LL;
	for(int i = 1; i <= n; i++){
		if(abs(r[i]-r[i+1]) < k || abs(r[i]-r[i-1]) < k || r[i] <= 0 || r[i] > n){
			ebin = false;
		}
	}
	if(ebin){
		for(int i = 1; i <= n; i++){
			cout << r[i] << " ";
		}
		cout << endl;
		return 0;
	}
	vector<int> uuh;
	for(int i = 0; i < n; i++)
		uuh.push_back(i+1);
 
	srand ( unsigned ( time(0) ) );
	for(int i = 0; i < 1500; i++){
		random_shuffle(uuh.begin(), uuh.end(), myrandom);
		bool okkkk = true;
			for(int i = 1; i < n; i++){
				if(abs(uuh[i]-uuh[i-1]) < k)
					okkkk = false;
			}
 
			if(okkkk){
				for(int i = 0; i < n; i++){
					cout << uuh[i] << " ";
				}
				cout << endl;
				return 0;
			}
	}
	cout << "QAQ" << 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: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED