LISDL

AtCoder

IDarc091_c

Time2000ms

Memory256MB

Difficulty—

Determine if there exists a sequence obtained by permuting $1,2,...,N$ that satisfies the following conditions: * The length of its longest increasing subsequence is $A$. * The length of its longest decreasing subsequence is $B$. If it exists, construct one such sequence. ## Constraints * $1 \leq N,A,B \leq 3\times 10^5$ * All input values are integers. ## Input Input is given from Standard Input in the following format: $N$ $A$ $B$ [samples] ## Notes A subsequence of a sequence $P$ is a sequence that can be obtained by extracting some of the elements in $P$ without changing the order. A longest increasing subsequence of a sequence $P$ is a sequence with the maximum length among the subsequences of $P$ that are monotonically increasing. Similarly, a longest decreasing subsequence of a sequence $P$ is a sequence with the maximum length among the subsequences of $P$ that are monotonically decreasing.

Samples

Input #1

5 3 2

Output #1

2 4 1 5 3

One longest increasing subsequence of this sequence is ${2,4,5}$, and one longest decreasing subsequence of it is ${4,3}$.

Input #2

7 7 1

Output #2

1 2 3 4 5 6 7

Input #3

300000 300000 300000

Output #3

\-1

API Response (JSON)

{
  "problem": {
    "name": "LISDL",
    "description": {
      "content": "Determine if there exists a sequence obtained by permuting $1,2,...,N$ that satisfies the following conditions: *   The length of its longest increasing subsequence is $A$. *   The length of its long",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc091_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Determine if there exists a sequence obtained by permuting $1,2,...,N$ that satisfies the following conditions:\n\n*   The length of its longest increasing subsequence is $A$.\n*   The length of its long...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments