LIS and LDS
All submissions for this problem are available.
Read problems statements in Mandarin Chinese, Russian and Vietnamese as well.
Chef is very fascinated by the Longest Increasing Subsequence problem. He continues to find many interesting things about them. Along the way he also learned about Longest Decreasing Subsequence problem.
Once again, Chef has come up with another problem involving them:
Given three integers A, B and N, output a permutation of [1,2,...,N] such that length of the longest increasing subsequence in the permutation is A and the length of the longest decreasing subsequence is B.
In case there are multiple possible answers, any one of them will be accepted.
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
Each test case consists of a single line containing three space separated integers N, A and B.
For each test case, output a single line containing N space separated integers, denoting the permutation of [1, 2, ..., N]. If no such permutation exists, output -1 instead.
- 1 ≤ T ≤ 105
- 1 ≤ N ≤ 105
- The sum of the Ns over all the test cases in a single test file is ≤ 106
- 1 ≤ A, B ≤ N
Input: 2 6 3 2 4 3 3 Output: 3 5 1 6 2 4 -1
Example case 1. In the array [3, 5, 1, 6, 2, 4], the longest increasing subsequence has length 3 (e.g. [3,5,6]), and the longest decreasing subsequence has length 2 (e.g. [3, 2]).
Example case 2. You can check that no permutation of [1, 2, 3, 4] has longest increasing subsequence and longest decreasing subsequence of length 3 at the same time.
|Tags||kevinsogo, lis, medium, snckpb16|
|Time Limit:||2.5 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.5, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.