A permutation p of size n is the sequence p1, p2, ..., pn, consisting of n distinct integers, each of them is from 1 to n (1 ≤ pi ≤ n).
A lucky permutation is such permutation p, that any integer i (1 ≤ i ≤ n) meets this condition ppi = n - i + 1.
You have integer n. Find some lucky permutation p of size n.
The first line contains integer n (1 ≤ n ≤ 105) — the required permutation size.
Print "-1" (without the quotes) if the lucky permutation p of size n doesn't exist.
Otherwise, print n distinct integers p1, p2, ..., pn (1 ≤ pi ≤ n) after a space — the required permutation.
If there are multiple answers, you can print any of them.
1
1
2
-1
4
2 4 1 3
5
2 5 3 1 4
题目的意思很简单,一个简单的置换,以数组的值为下标,可写成a[a[i]],然后求满足这种置换的一种情况
第一次碰到纯置换题,一个简单的思维题,我们可以多写几组,发现当n/2为奇数时我们必定输出-1,其实我们在写的时候就会发现,数字不可在本身的位置上,与其对应的数字(和为n+1的两个数)也不可以在这个位置上,所以说我们可以交换相邻的两组,如果n/2为奇数则会有一组无法交换,然后这个题就出来了。
代码:
#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int a[200000];
int main(){
int n;
scanf("%d",&n);
if((n>>1)&1){
return 0*printf("-1\n");
}
for(int i=1;i<=n;i++){
a[i]=i;
}
for(int i=1;i<=n;i+=2){
if(n&1&&i==n/2+1)
i++;
swap(a[i],a[i+1]);
}
//for(int i=1;i<=n;i++){
// printf("%d ",a[i]);
//}
//cout<<endl;
for(int i=2;i<=n/2;i+=2){
swap(a[i],a[n-i+1]);
}
for(int i=1;i<=n;i++){
printf(i==1?"%d":" %d",a[i]);
}
cout<<endl;
return 0;
}