codeforces 1770B. Koxia and Permutation
创始人
2024-05-06 06:28:19
0

B. Koxia and Permutation
Reve has two integers n and k.

Let p be a permutation† of length n. Let c be an array of length n−k+1 such that
ci=max(pi,…,pi+k−1)+min(pi,…,pi+k−1).
Let the cost of the permutation p be the maximum element of c.

Koxia wants you to construct a permutation with the minimum possible cost.

† A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array), and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).

Input
Each test consists of multiple test cases. The first line contains a single integer t (1≤t≤2000) — the number of test cases. The description of test cases follows.

The first line of each test case contains two integers n and k (1≤k≤n≤2⋅105).

It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.

Output
For each test case, output n integers p1,p2,…,pn, which is a permutation with minimal cost. If there is more than one permutation with minimal cost, you may output any of them.

Example
inputCopy
3
5 3
5 1
6 6
outputCopy
5 1 2 3 4
1 2 3 4 5
3 2 4 1 6 5
Note
In the first test case,

c1=max(p1,p2,p3)+min(p1,p2,p3)=5+1=6.
c2=max(p2,p3,p4)+min(p2,p3,p4)=3+1=4.
c3=max(p3,p4,p5)+min(p3,p4,p5)=4+2=6.
Therefore, the cost is max(6,4,6)=6. It can be proven that this is the minimal cost.

#include
using namespace std;
const int N=2e5+10;
int a[N]={0};
void solve(){int n,k;cin>>n>>k;if(k==1||k==n){for(int i=1;i<=n;i++)cout<a[i]=p-l;a[i+1]=l;l++;}for(int i=1;i<=n;i++){cout<int t;cin>>t;while(t--){solve();}
}
//code by yxisme;
//code by 01100_10111;

相关内容

热门资讯

本田crv和本田皓影哪个好? 本田crv和本田皓影哪个好?本田CRV和本田皓影属于统一级别的竞争车型,不过CRV的话毕竟是多次改款...
名字叫皓辰有什么含义 名字叫皓辰有什么含义“皓”有洁白明亮之意。“辰”有时光、日子的意思,古代汉语也通“晨”字,早晨。名字...
涓轰粈涔堟垜镓嬫満鍒�殑杞�欢... 涓轰粈涔堟垜镓嬫満鍒�殑杞�欢鍙�互涓婄绣浣嗙栌瀹%9是不是设置他不允许连接网络了啊
电脑开机出现这样。我按了f1。... 电脑开机出现这样。我按了f1。它就变这样了。怎么办。急急急!不懂关机重启即可点一下默认,退出就可以了
幼儿园中班音乐教案:勤快人和懒... 幼儿园中班音乐教案:勤快人和懒惰人 幼儿园中班音乐教案:勤快人和懒惰人   作为一名默默奉献的教育...
国外电影经典讲述一个女人偷盗有... 国外电影经典讲述一个女人偷盗有瘾的故事国外电影经典讲述一个女人偷盗有瘾的故事《艳贼》 Marnie ...
民生银行大股东阵容调整 民生银行的大股东阵容正经历深度调整。近日,香港立业集团有限公司通过场外交易的方式买入民生银行约1.9...
2025上海合作组织实数融合应... 转自:天津发布7月11日,2025上合组织数字经济论坛在津举行。当天下午,2025上海合作组织实数融...
东山少爷:唱好广州 东山少爷:唱好广州请问类似 东山少爷的 唱好广州 的歌曲是什么类型的 PS:一定是广州话的吗? ...
福瑞股份:Fs设备租赁费用根据... 证券日报网讯福瑞股份7月11日在公司回答调研者提问时表示,Fs设备对外租赁两种模式均存在,租赁费用根...