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;

相关内容

热门资讯

求几个爆笑段子 求几个爆笑段子cos演员杨大侠:山青青水盈盈,大侠cos逗笑人|搞笑天苍苍,野茫茫,杨大侠每日cos...
怎样揣摩一个冷艳美女的心理 怎样揣摩一个冷艳美女的心理详细一点,很重要的,谢咯这要看这个问题是男的还是女的了,不过会这么问应该是...
美年健康修订内幕信息知情人登记... 来源:中访网财观中访网数据  美年大健康产业控股股份有限公司(简称“美年健康”)近日披露了其内幕信息...
年内多家券商迎新任首席信息官 ...   炒股就看金麒麟分析师研报,权威,专业,及时,全面,助您挖掘潜力主题机会! 金融科技的迅猛发展与...
国海证券“22国海02”债券将... 来源:中访网财观中访网数据  国海证券股份有限公司(股票代码:000750)公告,其2022年面向专...
今夏10元内雪糕畅销 “刺客”... 转自:新安晚报  便利店的促销活动。   本报讯 近日,网红雪糕品牌钟薛高因旗下子公司钟茂(上...
百炼飞升录中秦凤鸣的女人 百炼飞升录中秦凤鸣的女人公孙静瑶(好像是)
口腔有哪些? 口腔有哪些?先很明确的告诉你,如果说一个人特别是情侣在另外一个人面前经常没有理由大吼大叫,还无理取闹...
怎样才能更有自信? 怎样才能更有自信?首先,要正确看待自己。寻找自己的长处。然后,让自己的长处得以发挥。这是最基本的获得...
怎么读罗是什么意思 怎么读罗是什么意思如果你是问的是粤语的话,意思是读法律的课程,“读罗”是粤语混合英语的综合结果,“罗...