题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e9, maxm = 4e4 + 5;
const int N = 1e6;const int mod = 1e9 + 7;
// const int mod = 998244353;
//const __int128 mod = 212370440130137957LL;
// int a[505][5005];
// bool vis[505][505];
// char s[3][maxn];
int a[maxn], b[maxn];
bool vis[maxn];
// string s;
int n, m;struct Node{int val, id;bool operator<(const Node &u)const{return val < u.val;}
};
// Node c[maxn];int ans[maxn];
int pre[maxn];char ask(int a, int b, int c, int d){char ch;cout << "? " << a << ' ' << b << ' ' << c << ' ' << d << '\n';cout.flush();cin >> ch;return ch;
}
//long long ? maxn ?
void solve(){int res = 0;int q, k;cin >> n >> k;// for(int i = 1; i <= n; i++){// 	cin >> a[i];// }vector<int> vec;vec.pb(0);for(int i = 1; i <= n; i++){vec.pb(i);}int cnt = (n + k - 1) / k;int half = k / 2;for(int i = 1; i <= n; i += k){int mid = min(n, i + half - 1);reverse(vec.begin() + i, vec.begin() + mid + 1);if(mid + 1 <= n){int ed = min(n, i + k - 1);reverse(vec.begin() + mid + 1, vec.begin() + ed + 1);}}for(int i = 1; i < vec.size(); i++){cout << vec[i] << ' ';}cout << '\n';cout << cnt << '\n';for(int i = 1; i <= n; i++){cout << (i - 1) / k + 1 << " \n"[i == n];}
}signed main(){ios::sync_with_stdio(0);cin.tie(0);int T = 1;cin >> T;while (T--){solve();}return 0;
}