Codeforces-solutions/Codeforces Round 988 (Div. 3)/C. Superultra's Favorite Permutation.cpp
Segcolt 88e542c982 Change the solution to be more simple.
The logic was much more simple than what I could have thought on the
contest...
2024-11-17 16:16:54 -03:00

114 lines
2.2 KiB
C++

/* Problem URL: https://codeforces.com/contest/2037/problem/C */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
if (n <= 4) {
cout << "-1\n";
continue;
}
vi odd;
vi even;
for (size_t i = 1; i <= n; i++) {
if (i & 1) {
odd.push_back(i);
} else {
even.push_back(i);
}
}
repv(i, odd) {
if (i != 5) {
cout << i << ' ';
}
}
cout << "5 4 ";
repv(i, even) {
if (i != 4) {
cout << i << ' ';
}
}
cout << '\n';
}
}