1352G.md (1405B)
1 Source: https://codeforces.com/problemset/problem/1352/G 2 3 G. Special Permutation 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 A permutation of length $n$ is an array $p=[p_1,p_2,\dots,p_n]$, which contains every integer from $1$ to $n$ (inclusive) and, moreover, each number appears exactly once. For example, $p=[3,1,4,2,5]$ is a permutation of length $5$. 22 23 For a given number $n$ ($n \ge 2$), find a permutation $p$ in which absolute difference (that is, the absolute value of difference) of any two neighboring (adjacent) elements is between $2$ and $4$, inclusive. Formally, find such permutation $p$ that $2 \le |p_i - p_{i+1}| \le 4$ for each $i$ ($1 \le i \lt n$). 24 25 Print any such permutation for the given integer $n$ or determine that it does not exist. 26 27 Input 28 29 The first line contains an integer $t$ ($1 \le t \le 100$) — the number of test cases in the input. Then $t$ test cases follow. 30 31 Each test case is described by a single line containing an integer $n$ ($2 \le n \le 1000$). 32 33 Output 34 35 Print $t$ lines. Print a permutation that meets the given requirements. If there are several such permutations, then print any of them. If no such permutation exists, print -1. 36 37 Example 38 39 Input 40 41 ``` 42 6 43 10 44 2 45 4 46 6 47 7 48 13 49 ``` 50 51 Output 52 53 ``` 54 9 6 10 8 4 7 3 1 5 2 55 -1 56 3 1 4 2 57 5 3 6 2 4 1 58 5 1 3 6 2 4 7 59 13 9 7 11 8 4 1 3 5 2 6 10 12 60 ```