Subarray Mex solution|Codesheff starter 23 for div 2(Rated)

Chef was on vacation when a thought struck him. Given three integers N,K,$N,K,$ and X,$X,$ he would like to make an array A$A$ of length N$N$ such that it satisfies the following conditions:

• 0≤Ai≤N$0\le A_i\le N$ for each 1≤i≤N$1\le i\le N$
• The MEX of every contiguous subarray of length K$K$ in A$A$ is X$X$.

Please help Chef in finding such an array. If there are multiple answers, you can output any configuration; and if there is no possible answer, output −1$-1$.

Note: The MEX of an array is the minimum non-negative integer that is not present in it. For example,

• The MEX of array [0,2,5,1]$[0,2,5,1]$ is 3,$3,$ because it contains 0,1$0,1$ and 2$2$ but not 3$3$.
• The MEX of array [1,2,5]$[1,2,5]$ is 0,$0,$ because 0$0$ is the smallest non-negative integer not present in the array.
• The MEX of array [0,1,2,3]$[0,1,2,3]$ is 4$4$.

Input Format

• The first line of input contains a single integer T$T$, denoting the number of test cases. The description of T$T$ test cases follows.
• Each test case consists of a single line of input, containing three space-separated integers N,K,X$N,K,X$ — the length of the required array, the length of subarrays to be checked, and the required MEX value respectively.

Output Format

For each test case, output a single line containing the answer:

• If no array satisfying the conditions exists, print −1$-1$.
• Otherwise, print N$N$ space-separated integers denoting the elements of the array, the ith$i^{th}$ of which is Ai$A_i$.

If there are multiple answers, you can output any of them.

Constraints

• 1≤T≤1200$1\le T\le 1200$
• 1≤N≤105$1\le N\le {10}^5$
• 0≤Ai≤N$0\le A_i\le N$
• 1≤X,K≤N$1\le X,K\le N$
• The sum of N$N$ over all test cases does not exceed 3⋅105$3\cdot {10}^5$

Sample Input 1 

3
3 3 3
4 3 2
5 4 5

Sample Output 1 

0 1 2
1 0 1 1
-1

Explanation

Test Case 1$1$: One possible answer is [0,1,2]$[0,1,2]$. The subarray of length 3$3$ has MEX 3$3$. Other possible answers are [0,2,1]$[0,2,1]$, [1,0,2]$[1,0,2]$, [1,2,0]$[1,2,0]$, [2,0,1]$[2,0,1]$, [2,1,0]$[2,1,0]$.

Test Case 2$2$: One possible answer is [1,0,1,1]$[1,0,1,1]$. There are two subarrays of length 3$3$ — [1,0,1]$[1,0,1]$ and [0,1,1]$[0,1,1]$. Both of them have MEX 2$2$, as required.

Test Case 3

Solution:

#include <iostream>

using namespace std;

int main()

{

    int t;

    cin>>t;

    while(t--){

        int n,k,x;

        cin>>n>>k>>x;

        if(k<x){

            cout<<-1<<endl;

        }else{

            int count=0;

            for(int i=0;i<n;i++){

                if(count==x){

                    count=0;

                }

                cout<<count<<" ";

                count++;

            }

        }

        cout<<endl;

    }

    return 0;

}

Solution: