Funny Permutation

最新推荐文章于 2024-09-15 11:40:06 发布

linalw

最新推荐文章于 2024-09-15 11:40:06 发布

阅读量395

点赞数 1

分类专栏：刷题文章标签： c++ 蓝桥杯算法

本文链接：https://blog.csdn.net/weixin_62599885/article/details/127304457

版权

刷题专栏收录该内容

34 篇文章 0 订阅

订阅专栏

Funny Permutation

A sequence of nn numbers is called permutation if it contains all numbers from 11 to nn exactly once. For example, the sequences [3, 1, 4, 2][3,1,4,2], [11] and [2,1][2,1] are permutations, but [1,2,1][1,2,1], [0,1][0,1] and [1,3,4][1,3,4] are not.

For a given number nn you need to make a permutation pp such that two requirements are satisfied at the same time:

For each element p_ipi, at least one of its neighbors has a value that differs from the value of p_ipi by one. That is, for each element p_ipi (1 \le i \le n1≤i≤n), at least one of its neighboring elements (standing to the left or right of p_ipi) must be p_i + 1pi+1, or p_i - 1pi−1.
the permutation must have no fixed points. That is, for every ii (1 \le i \le n1≤i≤n), p_i \neq ipi=i must be satisfied.

Let's call the permutation that satisfies these requirements funny.

For example, let n = 4n=4. Then [4, 3, 1, 24,3,1,2] is a funny permutation, since:

to the right of p_1=4p1=4 is p_2=p_1-1=4-1=3p2=p1−1=4−1=3;
to the left of p_2=3p2=3 is p_1=p_2+1=3+1=4p1=p2+1=3+1=4;
to the right of p_3=1p3=1 is p_4=p_3+1=1+1=2p4=p3+1=1+1=2;
to the left of p_4=2p4=2 is p_3=p_4-1=2-1=1p3=p4−1=2−1=1.
for all ii is p_i \ne ipi=i.

For a given positive integer nn, output any funny permutation of length nn, or output -1 if funny permutation of length nn does not exist.

Input

The first line of input data contains a single integer tt (1 \le t \le 10^41≤t≤104) — the number of test cases.

The description of the test cases follows.

Each test case consists of f single line containing one integer nn (2 \le n \le 2 \cdot 10^52≤n≤2⋅105).

It is guaranteed that the sum of nn over all test cases does not exceed 2 \cdot 10^52⋅105.

Output

For each test case, print on a separate line:

any funny permutation pp of length nn;
or the number -1 if the permutation you are looking for does not exist.

Sample 1

Inputcopy	Outputcopy
5 4 3 7 5 2	3 4 2 1 -1 6 7 4 5 3 2 1 5 4 1 2 3 2 1

题解：注意到把1 2 分别放到倒数第二，第一的位置，其余数字按序输出即可满足条件。

特别地，n=3时不满足，单独讨论。

#include <iostream>
using namespace std;
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		if (n == 3)
		{
			cout << -1 << endl;
		}
		else
		{
			for (int i = 3; i <= n; i++)
			{
				cout << i << " ";
			}
			cout << 2 << " " << 1 << endl;
		}
	}
}