Permutation by Sum

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

题意

给你个t表示样例个数，然后给你t个n,l,r,s分别表示有1-n个数，求是否可以找到一种排列方式使排列后的数组的[l,r]区间的元素之和为s

思路

只想到这么判断它是-1的情况，然后就不会了。 题中给了个区间，我们很容易通过区间知道元素的个数，之后就能求出l-r区间长度len的最小值和最大值，和s比较一下就行了，之后就是找一下s与最小值之间的差值，看能否平分到这len个数中如果不行就尽量分给后面的数，因为要避免重复

#include<stdio.h>
#include<string.h>
#include<queue>
#include<math.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=3e5+10;
#define inf 0x3f3f3f3f3f
int vis[1010];
int a[1010];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(vis,0,sizeof(vis));
        memset(a,0,sizeof(a));
        int n,l,r,s,minn=0,maxx=0,k=0;
        scanf("%d %d %d %d",&n,&l,&r,&s);
        int len=r-l+1;
        for(int i=1; i<=len; i++)
            minn+=i;
        for(int i=n; i>=n-len+1; i--)
            maxx+=i;
        //  printf("#####%d %d\n",minn,maxx);
        if(s<minn||s>maxx)
        {
            printf("-1\n");
            continue;
        }
        k=l-1;
        int cha=s-minn;
        int mo=cha%len;
        int d=cha/len;
        for(int i=len; i>=1; i--) //后面先加1 避免重复
        {
            int m=i;
            if(mo)
            {
                m++;
                mo--;
            }
            m+=d;
            a[++k]=m;  //存的是len区间里面应该改的
            vis[m]=1;
        }
        int ss=0;
        for(int i=1; i<=n; i++)
        {
            if(ss==l-1)    //如果区间从1开始直接break
                break;
            if(!vis[i])
            {
                printf("%d ",i);
                vis[i]=1;
                ss++;
                if(ss==l-1)
                    break;
            }
        }
        for(int i=l; i<=r; i++)
            printf("%d ",a[i]);
        for(int i=1; i<=n; i++)
        {
            if(!vis[i])
            {
                printf("%d ",i);
                vis[i]=1;
            }
        }
        printf("\n");
    }
    return 0;
}