Educational Codeforces Round 30 D. Merge Sort

D. Merge Sort

Problem Statement

    Merge sort is a well-known sorting algorithm. The main function that sorts the elements of array a with indices from [l, r) can be implemented as follows:

    1. If the segment [l, r) is already sorted in non-descending order (that is, for any i such that l ≤ i < r - 1 a[i] ≤ a[i + 1]), then end the function call;
    2. Let $mid=\lfloor \frac{l+r}{2}\rfloor$;
    3. Call mergesort(a, l, mid);
    4. Call mergesort(a, mid, r);
    5. Merge segments [l, mid) and [mid, r), making the segment [l, r) sorted in non-descending order. The merge algorithm doesn’t call any other functions.

    The array in this problem is 0-indexed, so to sort the whole array, you need to call mergesort(a, 0, n).
    The number of calls of function mergesort is very important, so Ivan has decided to calculate it while sorting the array. For example, if a = {1, 2, 3, 4}, then there will be 1 call of mergesort — mergesort(0, 4), which will check that the array is sorted and then end. If a = {2, 1, 3}, then the number of calls is 3: first of all, you call mergesort(0, 3), which then sets mid = 1 and calls mergesort(0, 1) and mergesort(1, 3), which do not perform any recursive calls because segments (0, 1) and (1, 3) are sorted.
    Ivan has implemented the program that counts the number of mergesort calls, but now he needs to test it. To do this, he needs to find an array a such that a is a permutation of size n (that is, the number of elements in a is n, and every integer number from [1, n] can be found in this array), and the number of mergesort calls when sorting the array is exactly k.
    Help Ivan to find an array he wants!

Input

    The first line contains two numbers n and k (1 ≤ n ≤ 100000, 1 ≤ k ≤ 200000) — the size of a desired permutation and the number of mergesort calls required to sort it.

Output

    If a permutation of size n such that there will be exactly k calls of mergesort while sorting it doesn’t exist, output  - 1. Otherwise output n integer numbers a[0], a[1], …, a[n - 1] — the elements of a permutation that would meet the required conditions. If there are multiple answers, print any of them.

Examples

Example 1
    Input
        3 3
    Output
        2 1 3
Example 2
    Input
        4 1
    Output
        1 2 3 4
Example 3
    Input
        5 6
    Output
        -1

题意

    给你n,k,让你构造出一个数组，使得该数组包含1~n且可以通过正好调用k次归并排序来是他变得从小到大有序。

思路

    这题的话，我们可以首先建出[0,n)区间如果调用归并排序的操作树，然后进行BFS，对于目前拿到的这个区间，我们将该区间的a[mid]和a[mid-1]进行交换，然后将他的两个子区间扔进队列，tot+=2，如果tot>=k就可以直接退出。还有一点，我们可以很显然地看出，当k为偶数的时候是不存在数组可以做的，所以可以直接特判。
    当时我……在BFS的时候忘了对队列进行pop……手残wa了2两发..2333

Code

#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline void readInt(int &x) {
    x=0;int f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    x*=f;
}
inline void readLong(ll &x) {
    x=0;int f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    x*=f;
}
/*================Header Template==============*/
typedef pair<int,int> pii;
int x[100010],n,k;
queue<pii> q;
int main() {
    readInt(n);
    readInt(k);
    for(int i=0;i<n;i++)
        x[i]=i+1; 
    if(!(k&1)) {
        puts("-1");
        return 0;
    }
    int ans=1;
    q.push(make_pair(0,n));
    while(!q.empty()) {
        if(ans>=k)
            break;
        int l=q.front().first,r=q.front().second;
        q.pop();
        if(l+1==r)
            continue;
        int mid=(l+r)>>1;
        swap(x[mid],x[mid-1]);
        ans+=2;
        q.push(make_pair(l,mid));
        q.push(make_pair(mid,r));
    }
    if(ans<k) {
        puts("-1");
        return 0;
    }
    for(int i=0;i<n;i++)
        printf("%d%c",x[i],i==n-1?'\n':' ');
    return 0;
}