Permutation by Sum CodeForces - 1512E（ 思维 ）

A permutation is a sequence of n integers from 1 to n, in which all the numbers occur exactly once. For example, [1], [3,5,2,1,4], [1,3,2] are permutations, and [2,3,2], [4,3,1], [0] are not.

Polycarp was given four integers n, l, r (1≤l≤r≤n) and s (1≤s≤n(n+1)2) and asked to find a permutation p of numbers from 1 to n that satisfies the following condition:

s=pl+pl+1+…+pr.
For example, for n=5, l=3, r=5, and s=8, the following permutations are suitable (not all options are listed):

p=[3,4,5,2,1];
p=[5,2,4,3,1];
p=[5,2,1,3,4].
But, for example, there is no permutation suitable for the condition above for n=4, l=1, r=1, and s=5.
Help Polycarp, for the given n, l, r, and s, find a permutation of numbers from 1 to n that fits the condition above. If there are several suitable permutations, print any of them.

Input
The first line contains a single integer t (1≤t≤500). Then t test cases follow.

Each test case consist of one line with four integers n (1≤n≤500), l (1≤l≤n), r (l≤r≤n), s (1≤s≤n(n+1)2).

It is guaranteed that the sum of n for all input data sets does not exceed 500.

Output
For each test case, output on a separate line:

n integers — a permutation of length n that fits the condition above if such a permutation exists;
-1, otherwise.
If there are several suitable permutations, print any of them.

Example

Input

5
5 2 3 5
5 3 4 1
3 1 2 4
2 2 2 2
2 1 1 3

Output

1 2 3 4 5
-1
1 3 2
1 2
-1

题意：

对n个数进行排位置，要求n个数为1-n，在l-r区间位置上的数的和为s，如果可以排成符合要求的序列，输出序列，不可以则输出-1

思路：

先计算l-r区间内和的最小值，设l-r区间内有len个数，则len=r-l+1 ，则和的最小值为1+2+…+len。

判断l-r区间最小和与s的大小，如果最小和仍比s大，说明构造不出符合题意的序列 如果最小值等于s，按要求输出即可。

如果最小和小于s，判断s与len的大小，如果s>=len，说明可以将l-r区间内的每个数都再加上1，判断l-r区间+1后的最大值是否大于n，如果大于n，就不符合要求，如果区间内的数都+1后，还是不够s，那么就从l-r区间内最大的数开始+1（不超过n的条件下），最大的数+1后s还大于0，则让l-r区间内倒数第二个数+1，依次类推，最后按题意要求输出即可。

代码：

#include<stdio.h>
#include<string.h>
#include<map>
#include<algorithm>
using namespace std;
int book[1010],a[1010];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(book,0,sizeof(book));
        memset(a,0,sizeof(a));
        int n,l,r,s;
        scanf("%d %d %d %d",&n,&l,&r,&s);
        int len=r-l+1;
        int sum=0;
        for(int i=1;i<=len;i++)
            sum+=i;
        if(sum>s)
        {
            printf("-1\n");
            continue;
        }
        s=s-sum;
        int k=len;
        while(len<=s)//剩余的S足够len长度内的数每个数都在+1
        {
            k++;
            s-=len;//每个数都+1,总数减去len长度个1
        }
        if((k+1>n&&s)||k>n)
            printf("-1\n");
        else
        {
            for(int i=l;i<=r;i++)
            {
                if(s>0)
                    a[i]=k+1;
                else
                    a[i]=k;

                book[a[i]]=1;
                s--;
                k--;
            }
            int w=1;
            for(int i=1;i<=n;i++)
            {
                if(a[i])//l到r区间内的值
                {
                    if(i==1)
                        printf("%d",a[i]);
                    else
                        printf(" %d",a[i]);
                }
                else//l到r区间以外的值为1-n之间没有输出过的
                {
                    while(book[w])
                        w++;
                    book[w]=1;
                    if(i==1)
                        printf("%d",w);
                    else
                        printf(" %d",w);
                }
            }
            printf("\n");
        }
    }
    return 0;
}