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;

相关内容

热门资讯

365夜故事好词? 365夜故事好词?好词:动如脱兔 待兔守株 得兔忘蹄 东兔西乌 龟毛兔角 狐死兔泣 获兔烹狗 狐兔之...
魏忠贤是好人还是坏人? 魏忠贤是好人还是坏人? 魏忠贤是坏人。在我们的印象中,魏忠贤就是一个十恶不赦,谄媚逢迎,艰险阴狠的小...
柯南最新的一集对应的是漫画第几... 柯南最新的一集对应的是漫画第几话2,6,78话841-843香甜冰冷的快递香甜冰冷的快递对应漫画:F...
闽浙两地开展跨界流域突发环境事... 转自:中国环境网7月10日,福建省南平市生态环境局、浙江省丽水市生态环境局共同开展跨省应急联动演练。...
专访丨巴西看穿美国政治讹诈本质... 新华社里约热内卢7月11日电 题:巴西看穿美国政治讹诈本质 因而坚定“说不”——巴西法学教授卡瓦略谈...
拳脚生风展英姿!“英派斯杯”青... 7月10日-12日,“英派斯杯”青岛市第六届运动会青少年组跆拳道比赛在青岛市即墨区岘山小学举行。本次...
血液病学专家周淑芸逝世,享年9... 转自:京报网_北京日报官方网站 【#血液病学专家周淑芸逝...
守望:红色保密往事丨隐秘而伟大 转自:央视新闻客户端  百余年前中国,风雨飘摇。有一群人改名换姓,隐藏行踪,秘密集结,以独创暗语交换...
湖南汨罗一少年在游泳馆内触电身... 近日,有市民反映,湖南岳阳汨罗市一游泳馆内疑似发生因漏电致人死亡的事故。7月12日下午,澎湃新闻从汨...
中国煤炭大市:从“黑”到“绿”... 中新网鄂尔多斯7月12日电 题:中国煤炭大市:从“黑”到“绿”蜕变记中新网记者 李爱平“以前干活,摘...