QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#280468 | #7778. Turning Permutation | ucup-team987# | AC ✓ | 1ms | 3716kb | C++20 | 14.2kb | 2023-12-09 16:18:23 | 2023-12-09 16:18:26 |
Judging History
answer
/**
* date : 2023-12-09 17:18:14
* author : Nyaan
*/
#define NDEBUG
using namespace std;
// intrinstic
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// utility
namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename U>
struct P : pair<T, U> {
template <typename... Args>
P(Args... args) : pair<T, U>(args...) {}
using pair<T, U>::first;
using pair<T, U>::second;
P &operator+=(const P &r) {
first += r.first;
second += r.second;
return *this;
}
P &operator-=(const P &r) {
first -= r.first;
second -= r.second;
return *this;
}
P &operator*=(const P &r) {
first *= r.first;
second *= r.second;
return *this;
}
template <typename S>
P &operator*=(const S &r) {
first *= r, second *= r;
return *this;
}
P operator+(const P &r) const { return P(*this) += r; }
P operator-(const P &r) const { return P(*this) -= r; }
P operator*(const P &r) const { return P(*this) *= r; }
template <typename S>
P operator*(const S &r) const {
return P(*this) *= r;
}
P operator-() const { return P{-first, -second}; }
};
using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;
constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;
template <typename T>
int sz(const T &t) {
return t.size();
}
template <typename T, typename U>
inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
inline T Max(const vector<T> &v) {
return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
return accumulate(begin(v), end(v), 0LL);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
return upper_bound(begin(v), end(v), a) - begin(v);
}
constexpr long long TEN(int n) {
long long ret = 1, x = 10;
for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
return ret;
}
template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
return make_pair(t, u);
}
template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
vector<T> ret(v.size() + 1);
if (rev) {
for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
} else {
for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
}
return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
vector<T> ret(v);
sort(ret.begin(), ret.end());
ret.erase(unique(ret.begin(), ret.end()), ret.end());
return ret;
}
template <typename F>
vector<int> mkord(int N, F f) {
vector<int> ord(N);
iota(begin(ord), end(ord), 0);
sort(begin(ord), end(ord), f);
return ord;
}
template <typename T>
vector<int> mkinv(vector<T> &v) {
int max_val = *max_element(begin(v), end(v));
vector<int> inv(max_val + 1, -1);
for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
return inv;
}
vector<int> mkiota(int n) {
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
return ret;
}
template <typename T>
T mkrev(const T &v) {
T w{v};
reverse(begin(w), end(w));
return w;
}
template <typename T>
bool nxp(vector<T> &v) {
return next_permutation(begin(v), end(v));
}
// 返り値の型は入力の T に依存
// i 要素目 : [0, a[i])
template <typename T>
vector<vector<T>> product(const vector<T> &a) {
vector<vector<T>> ret;
vector<T> v;
auto dfs = [&](auto rc, int i) -> void {
if (i == (int)a.size()) {
ret.push_back(v);
return;
}
for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();
};
dfs(dfs, 0);
return ret;
}
// F : function(void(T&)), mod を取る操作
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I, const function<void(T &)> &f) {
T res = I;
for (; n; f(a = a * a), n >>= 1) {
if (n & 1) f(res = res * a);
}
return res;
}
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I = T{1}) {
return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});
}
template <typename T>
T Rev(const T &v) {
T res = v;
reverse(begin(res), end(res));
return res;
}
template <typename T>
vector<T> Transpose(const vector<T> &v) {
using U = typename T::value_type;
int H = v.size(), W = v[0].size();
vector res(W, T(H, U{}));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
res[j][i] = v[i][j];
}
}
return res;
}
template <typename T>
vector<T> Rotate(const vector<T> &v, int clockwise = true) {
using U = typename T::value_type;
int H = v.size(), W = v[0].size();
vector res(W, T(H, U{}));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (clockwise) {
res[W - 1 - j][i] = v[i][j];
} else {
res[j][H - 1 - i] = v[i][j];
}
}
}
return res;
}
} // namespace Nyaan
// bit operation
namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
return _mm_popcnt_u64(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
} // namespace Nyaan
// inout
namespace Nyaan {
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
istream &operator>>(istream &is, __int128_t &x) {
string S;
is >> S;
x = 0;
int flag = 0;
for (auto &c : S) {
if (c == '-') {
flag = true;
continue;
}
x *= 10;
x += c - '0';
}
if (flag) x = -x;
return is;
}
istream &operator>>(istream &is, __uint128_t &x) {
string S;
is >> S;
x = 0;
for (auto &c : S) {
x *= 10;
x += c - '0';
}
return is;
}
ostream &operator<<(ostream &os, __int128_t x) {
if (x == 0) return os << 0;
if (x < 0) os << '-', x = -x;
string S;
while (x) S.push_back('0' + x % 10), x /= 10;
reverse(begin(S), end(S));
return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
if (x == 0) return os << 0;
string S;
while (x) S.push_back('0' + x % 10), x /= 10;
reverse(begin(S), end(S));
return os << S;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupnya;
} // namespace Nyaan
// debug
#ifdef NyaanDebug
#define trc(...) (void(0))
#else
#define trc(...) (void(0))
#endif
#ifdef NyaanLocal
#define trc2(...) (void(0))
#else
#define trc2(...) (void(0))
#endif
// macro
#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define in2(s, t) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i]); \
}
#define in3(s, t, u) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i]); \
}
#define in4(s, t, u, v) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i], v[i]); \
}
#define die(...) \
do { \
Nyaan::out(__VA_ARGS__); \
return; \
} while (0)
namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }
//
using namespace std;
template <typename mint>
vector<vector<mint>> binomial_table(int n) {
n += 10;
vector dp(n, vector(n, mint{0}));
dp[0][0] = 1;
for (int i = 0; i + 1 < n; i++) {
for (int j = 0; j <= i; j++) {
dp[i + 1][j + 0] += dp[i][j];
dp[i + 1][j + 1] += dp[i][j];
}
}
return dp;
}
using namespace Nyaan;
vvl C = binomial_table<ll>(52);
ll pre[60];
ll add(ll a, ll b) { return min(infLL, a + b); }
void precalc(int N) {
// 前が i 個空いてる
// 後ろが j 個空いてる
// k : 1 次は前 / 2 次は後ろ / 3 どっちでも
ll dp[55][55][4];
rep(i, N + 1) rep(j, N + 1) rep(k, 4) dp[i][j][k] = 0;
pre[0] = pre[1] = dp[0][0][1] = dp[0][0][2] = dp[0][0][3] = 1;
rep1(d, N - 1) rep(i, d + 1) {
int j = d - i;
rep1(u, 3) {
if (u & 1) {
rep(k, i) dp[i][j][u] = add(dp[i][j][u], dp[k][j + i - 1 - k][2]);
}
if (u & 2) {
rep(k, j) dp[i][j][u] = add(dp[i][j][u], dp[i + j - 1 - k][k][1]);
}
// if (dp[i][j][u]) trc(i, j, u, dp[i][j][u]);
}
pre[d + 1] = add(pre[d + 1], dp[i][j][3]);
}
// rep(i, N + 1) cerr << pre[i] << " \n"[i == N];
}
/*
// n 個の 0 と m 個の 1 が登場する, k は 0-indexed
vi permutation(int n, int m, ll k) {
assert(k < C[n + m][n]);
vi res;
while (n > 0 or m > 0) {
if (n != 0 and k < C[n - 1 + m][m]) {
res.push_back(0);
n--;
} else {
k -= C[n - 1 + m][m];
res.push_back(1);
m--;
}
}
assert(k == 0);
return res;
}
*/
i128 mul(i128 a, i128 b) { return min<i128>(a * b, infLL); }
ll takou(vi v) {
ll S = Sum(v);
ll res = 1;
each(x, v) res *= C[S][x], S -= x;
return res;
}
vi calc(int N, ll K) {
if (N <= 1) {
assert(K == 0);
return mkiota(N);
}
vi ans;
V<vi> pieces;
// 0 偶数のみ選べる 1 奇数のみ選べる 2 両方選べる
pieces.push_back(vi{0, N, 2});
auto choose = [&](int i) -> pair<bool, vvi> {
int exist = false;
V<vi> nxt;
each(p, pieces) {
if (p[0] <= i and i < p[1]) {
exist = true;
if (p[1] - p[0] >= 2) {
if (i % 2 == 0 and p[2] == 1) return {false, {}};
if (i % 2 == 1 and p[2] == 0) return {false, {}};
}
vi q{p[0], i, i % 2};
vi r{i + 1, p[1], i % 2};
if (q[0] < q[1]) nxt.push_back(q);
if (r[0] < r[1]) nxt.push_back(r);
} else {
nxt.push_back(p);
}
}
if (!exist) return {false, {}};
return {true, nxt};
};
while (!pieces.empty()) {
trc(ans);
trc(pieces);
int upd = false;
rep(i, N) {
auto [flag, nxt] = choose(i);
if (!flag) continue;
ll way = 1;
{
vi num;
each(p, nxt) num.push_back(p[1] - p[0]);
way = takou(num);
}
each(p, nxt) {
int j = p[1] - p[0];
ll k = j < 2 ? pre[j] : pre[j] / 2;
way = mul(way, k);
}
if (K < way) {
ans.push_back(i);
pieces = nxt;
upd = true;
break;
} else {
K -= way;
}
}
assert(upd);
}
return ans;
}
vi naive(int N, ll K) {
vvi anss;
vi q = mkiota(N);
do {
int ok = 1;
rep1(i, N - 2) {
if ((q[i] - q[i - 1]) * (q[i] - q[i + 1]) < 0) ok = 0;
}
if (ok) anss.push_back(mkinv(q));
} while (nxp(q));
sort(all(anss));
assert(K < sz(anss));
return anss[K];
}
void q() {
inl(N, K);
if (pre[N] < K) die(-1);
auto ans = calc(N, K - 1);
each(x, ans) x++;
out(ans);
}
void Nyaan::solve() {
precalc(52);
if (0) {
reg(N, 3, 7) {
rep(K, pre[N]) {
auto an = naive(N, K);
auto ac = calc(N, K);
trc2(N, K, an, ac);
assert(an == ac);
}
}
}
int t = 1;
// in(t);
while (t--) q();
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3600kb
input:
3 2
output:
2 1 3
result:
ok 3 number(s): "2 1 3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
3 5
output:
-1
result:
ok 1 number(s): "-1"
Test #3:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
4 6
output:
3 1 2 4
result:
ok 4 number(s): "3 1 2 4"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
4 11
output:
-1
result:
ok 1 number(s): "-1"
Test #5:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
3 1
output:
1 3 2
result:
ok 3 number(s): "1 3 2"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
3 10
output:
-1
result:
ok 1 number(s): "-1"
Test #7:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
3 52
output:
-1
result:
ok 1 number(s): "-1"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
3 756
output:
-1
result:
ok 1 number(s): "-1"
Test #9:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
3 7721
output:
-1
result:
ok 1 number(s): "-1"
Test #10:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
5 1
output:
1 3 2 5 4
result:
ok 5 number(s): "1 3 2 5 4"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
5 8
output:
2 4 1 3 5
result:
ok 5 number(s): "2 4 1 3 5"
Test #12:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
5 85
output:
-1
result:
ok 1 number(s): "-1"
Test #13:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
5 846
output:
-1
result:
ok 1 number(s): "-1"
Test #14:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
5 6957
output:
-1
result:
ok 1 number(s): "-1"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
8 1
output:
1 3 2 5 4 7 6 8
result:
ok 8 numbers
Test #16:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
8 7
output:
1 3 2 5 7 8 4 6
result:
ok 8 numbers
Test #17:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
8 71
output:
1 3 7 5 4 2 6 8
result:
ok 8 numbers
Test #18:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
8 863
output:
3 5 7 1 4 2 8 6
result:
ok 8 numbers
Test #19:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
8 7099
output:
-1
result:
ok 1 number(s): "-1"
Test #20:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
10 100000
output:
10 8 4 6 9 2 7 3 5 1
result:
ok 10 numbers
Test #21:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
10 62278
output:
7 1 9 8 5 10 3 6 2 4
result:
ok 10 numbers
Test #22:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
10 1000000
output:
-1
result:
ok 1 number(s): "-1"
Test #23:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
10 572106
output:
-1
result:
ok 1 number(s): "-1"
Test #24:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
10 10000000
output:
-1
result:
ok 1 number(s): "-1"
Test #25:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
10 9715489
output:
-1
result:
ok 1 number(s): "-1"
Test #26:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
10 100000000
output:
-1
result:
ok 1 number(s): "-1"
Test #27:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
10 85089137
output:
-1
result:
ok 1 number(s): "-1"
Test #28:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
10 1000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #29:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
10 906109922
output:
-1
result:
ok 1 number(s): "-1"
Test #30:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
15 100000
output:
1 3 2 5 7 9 13 15 11 6 4 14 10 8 12
result:
ok 15 numbers
Test #31:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
15 99389
output:
1 3 2 5 7 9 13 15 6 4 11 8 10 14 12
result:
ok 15 numbers
Test #32:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
15 1000000
output:
1 3 2 7 15 13 5 11 6 9 8 14 4 10 12
result:
ok 15 numbers
Test #33:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
15 691130
output:
1 3 2 7 9 5 11 4 13 6 15 12 10 8 14
result:
ok 15 numbers
Test #34:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
15 10000000
output:
1 3 7 5 4 9 13 11 6 15 10 12 14 2 8
result:
ok 15 numbers
Test #35:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
15 8403898
output:
1 3 5 13 15 9 7 6 11 12 10 8 14 2 4
result:
ok 15 numbers
Test #36:
score: 0
Accepted
time: 1ms
memory: 3660kb
input:
15 100000000
output:
1 9 5 7 13 11 12 3 15 10 14 2 6 4 8
result:
ok 15 numbers
Test #37:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
15 80159790
output:
1 7 9 15 11 5 13 3 4 8 12 10 14 2 6
result:
ok 15 numbers
Test #38:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
15 1000000000
output:
4 14 10 6 15 8 2 5 12 3 11 7 13 9 1
result:
ok 15 numbers
Test #39:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
15 941321083
output:
4 12 2 14 10 8 9 1 3 6 7 13 11 5 15
result:
ok 15 numbers
Test #40:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
20 100000000000000
output:
3 15 9 13 1 19 7 5 14 11 6 20 8 12 10 17 16 2 4 18
result:
ok 20 numbers
Test #41:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
20 88340160907341
output:
3 9 7 15 5 17 19 16 13 11 14 12 1 18 8 20 6 10 4 2
result:
ok 20 numbers
Test #42:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
20 1000000000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #43:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
20 825683798851116
output:
-1
result:
ok 1 number(s): "-1"
Test #44:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
20 10000000000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #45:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
20 7757196171989613
output:
-1
result:
ok 1 number(s): "-1"
Test #46:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
20 100000000000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #47:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
20 97697763625539018
output:
-1
result:
ok 1 number(s): "-1"
Test #48:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
20 1000000000000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #49:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
20 828662389005083354
output:
-1
result:
ok 1 number(s): "-1"
Test #50:
score: 0
Accepted
time: 1ms
memory: 3660kb
input:
21 100000000000000
output:
1 7 11 13 17 9 3 21 15 19 18 12 16 5 8 4 20 14 2 6 10
result:
ok 21 numbers
Test #51:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
21 84706086886746
output:
1 7 3 9 13 17 5 15 19 8 6 11 4 21 12 2 20 18 14 10 16
result:
ok 21 numbers
Test #52:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
21 1000000000000000
output:
3 5 1 11 2 13 9 17 21 15 12 7 4 14 10 19 18 6 20 16 8
result:
ok 21 numbers
Test #53:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
21 554929680010592
output:
2 8 10 18 16 4 6 5 14 9 12 7 20 15 11 1 13 21 3 17 19
result:
ok 21 numbers
Test #54:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
21 10000000000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #55:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
21 6191328159326492
output:
14 4 2 10 1 6 5 20 12 8 9 7 16 18 21 15 11 13 3 19 17
result:
ok 21 numbers
Test #56:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
21 100000000000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #57:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
21 78209209037176977
output:
-1
result:
ok 1 number(s): "-1"
Test #58:
score: 0
Accepted
time: 1ms
memory: 3716kb
input:
21 1000000000000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #59:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
21 924750540534119586
output:
-1
result:
ok 1 number(s): "-1"
Test #60:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
22 100000000000000
output:
1 3 5 21 19 15 22 2 11 9 10 7 6 4 20 17 18 16 13 14 12 8
result:
ok 22 numbers
Test #61:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
22 81076307833447
output:
1 3 5 17 15 9 13 11 14 7 19 12 8 18 4 2 21 20 22 16 6 10
result:
ok 22 numbers
Test #62:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
22 1000000000000000
output:
1 5 19 21 17 13 11 20 7 12 3 15 22 9 16 18 6 2 10 8 14 4
result:
ok 22 numbers
Test #63:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
22 784179856137365
output:
1 5 11 13 12 7 19 21 3 9 17 18 15 22 14 6 8 2 20 10 4 16
result:
ok 22 numbers
Test #64:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
22 10000000000000000
output:
2 16 4 6 5 20 18 10 8 22 12 14 11 17 1 13 19 9 7 3 15 21
result:
ok 22 numbers
Test #65:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
22 9625464441630667
output:
2 14 12 16 18 10 11 20 22 4 19 6 8 7 17 9 21 15 3 5 13 1
result:
ok 22 numbers
Test #66:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
22 100000000000000000
output:
16 20 8 2 6 4 18 12 14 13 5 17 3 10 9 15 7 22 11 21 1 19
result:
ok 22 numbers
Test #67:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
22 58720645858880344
output:
10 8 2 6 7 4 16 18 9 12 14 17 11 20 22 3 19 5 21 1 13 15
result:
ok 22 numbers
Test #68:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
22 1000000000000000000
output:
-1
result:
ok 1 number(s): "-1"
Test #69:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
22 797466650913412732
output:
-1
result:
ok 1 number(s): "-1"
Test #70:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
23 100000000000000
output:
1 3 2 9 13 15 19 11 5 23 17 21 20 14 18 7 10 6 22 16 4 8 12
result:
ok 23 numbers
Test #71:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
23 77446528780149
output:
1 3 2 7 21 9 23 5 19 20 8 17 11 15 6 18 22 13 14 10 4 16 12
result:
ok 23 numbers
Test #72:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
23 1000000000000000
output:
1 3 5 17 15 16 21 23 4 9 13 7 2 14 19 11 8 10 6 18 12 20 22
result:
ok 23 numbers
Test #73:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
23 513430032264138
output:
1 3 5 7 13 17 9 8 11 23 10 6 4 21 15 14 19 16 18 12 20 2 22
result:
ok 23 numbers
Test #74:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
23 10000000000000000
output:
1 5 9 21 19 3 23 11 2 15 22 20 4 13 17 7 14 6 10 12 18 8 16
result:
ok 23 numbers
Test #75:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
23 8059600723934841
output:
1 5 3 9 21 7 17 11 4 19 6 23 8 20 13 15 18 2 10 12 16 22 14
result:
ok 23 numbers
Test #76:
score: 0
Accepted
time: 1ms
memory: 3660kb
input:
23 100000000000000000
output:
2 8 10 14 12 6 18 4 13 11 20 19 3 1 22 7 23 21 16 9 17 5 15
result:
ok 23 numbers
Test #77:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
23 62604119535359335
output:
1 21 17 5 11 3 4 19 23 7 20 9 13 15 8 18 22 14 6 2 10 16 12
result:
ok 23 numbers
Test #78:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
23 1000000000000000000
output:
12 8 6 22 4 20 2 14 13 16 1 7 18 10 9 11 17 3 15 23 21 19 5
result:
ok 23 numbers
Test #79:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
23 670182765587673173
output:
8 14 18 12 10 22 16 15 4 9 11 20 2 6 7 19 17 21 5 23 3 1 13
result:
ok 23 numbers
Test #80:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
30 100000000000000
output:
1 3 2 5 4 7 6 9 8 11 13 29 27 23 30 10 19 17 18 15 14 12 28 25 26 24 21 22 20 16
result:
ok 30 numbers
Test #81:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
30 67586042048201
output:
1 3 2 5 4 7 6 9 8 11 13 21 27 29 15 10 17 19 20 23 12 28 22 25 16 26 18 24 14 30
result:
ok 30 numbers
Test #82:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
30 1000000000000000
output:
1 3 2 5 4 7 6 9 8 13 27 29 25 21 19 28 15 20 11 23 30 17 24 26 14 10 18 16 22 12
result:
ok 30 numbers
Test #83:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
30 759815786187925
output:
1 3 2 5 4 7 6 9 8 13 17 29 25 27 19 26 11 18 10 23 21 22 28 15 14 24 12 30 16 20
result:
ok 30 numbers
Test #84:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
30 10000000000000000
output:
1 3 2 5 4 7 6 9 11 19 10 27 13 25 21 26 12 15 23 29 14 17 8 16 22 18 28 24 30 20
result:
ok 30 numbers
Test #85:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
30 8268632993693498
output:
1 3 2 5 4 7 6 9 11 15 23 17 21 19 20 13 25 27 26 29 8 16 30 18 12 10 14 22 28 24
result:
ok 30 numbers
Test #86:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
30 100000000000000000
output:
1 3 2 5 4 7 6 9 29 15 11 13 21 25 30 27 10 28 8 26 23 14 19 22 12 20 24 17 18 16
result:
ok 30 numbers
Test #87:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
30 70413882594766775
output:
1 3 2 5 4 7 6 9 23 17 8 25 13 24 11 21 12 19 27 20 29 15 14 10 16 18 26 22 28 30
result:
ok 30 numbers
Test #88:
score: 0
Accepted
time: 1ms
memory: 3708kb
input:
30 1000000000000000000
output:
1 3 2 5 4 7 6 29 27 11 13 28 15 17 12 21 16 19 25 30 9 23 8 26 20 18 14 10 24 22
result:
ok 30 numbers
Test #89:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
30 508539703844690157
output:
1 3 2 5 4 7 6 19 21 9 25 15 27 17 23 29 26 30 11 20 13 10 14 28 16 18 22 8 12 24
result:
ok 30 numbers
Test #90:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
40 100000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 23 39 37 33 40 20 29 27 28 25 24 22 38 35 36 34 31 32 30 26
result:
ok 40 numbers
Test #91:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
40 74799363565017
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 23 33 37 29 31 35 39 34 25 36 40 27 24 20 26 22 28 30 32 38
result:
ok 40 numbers
Test #92:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
40 1000000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 23 37 39 35 31 29 38 25 30 21 33 40 27 34 36 24 20 28 26 32 22
result:
ok 40 numbers
Test #93:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
40 693952068492030
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 23 25 35 27 24 33 29 31 28 21 37 34 39 32 40 30 38 36 22 26 20
result:
ok 40 numbers
Test #94:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
40 10000000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 21 29 20 37 23 35 31 36 22 25 33 39 24 27 18 26 32 28 38 34 40 30
result:
ok 40 numbers
Test #95:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
40 8780069815397382
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 21 27 18 37 35 23 29 31 25 24 22 28 39 36 33 34 26 30 20 40 38 32
result:
ok 40 numbers
Test #96:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
40 100000000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 39 25 21 23 31 35 40 37 20 38 18 36 33 24 29 32 22 30 34 27 28 26
result:
ok 40 numbers
Test #97:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
40 93129997269027238
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 37 33 18 21 25 29 27 35 28 39 31 34 38 20 36 40 30 23 22 32 26 24
result:
ok 40 numbers
Test #98:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
40 1000000000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 39 37 21 23 38 25 27 22 31 26 29 35 40 19 33 18 36 30 28 24 20 34 32
result:
ok 40 numbers
Test #99:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
40 688417018684296961
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 33 29 35 31 39 30 37 23 27 32 34 25 24 26 19 21 36 18 28 20 22 38 40
result:
ok 40 numbers
Test #100:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
50 100000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 28 31 33 49 47 43 50 30 39 37 38 35 34 32 48 45 46 44 41 42 40 36
result:
ok 50 numbers
Test #101:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
50 54049539673174
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 28 31 33 39 30 49 50 41 47 45 37 43 38 44 40 42 35 34 48 36 46 32
result:
ok 50 numbers
Test #102:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
50 1000000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 28 33 47 49 45 41 39 48 35 40 31 43 50 37 44 46 34 30 38 36 42 32
result:
ok 50 numbers
Test #103:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
50 628092645763432
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 28 33 31 43 49 35 30 50 41 32 45 47 44 46 37 42 34 39 40 38 48 36
result:
ok 50 numbers
Test #104:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
50 10000000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 31 39 30 47 33 45 41 46 32 35 43 49 34 37 28 36 42 38 48 44 50 40
result:
ok 50 numbers
Test #105:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
50 7663543491875229
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 31 35 30 49 37 47 41 33 39 28 50 43 42 40 36 45 38 44 46 32 34 48
result:
ok 50 numbers
Test #106:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
50 100000000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 49 35 31 33 41 45 50 47 30 48 28 46 43 34 39 42 32 40 44 37 38 36
result:
ok 50 numbers
Test #107:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
50 65846107648320403
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 41 49 31 45 35 37 33 50 43 42 39 34 44 36 47 48 32 46 40 28 30 38
result:
ok 50 numbers
Test #108:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
50 1000000000000000000
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 49 47 31 33 48 35 37 32 41 36 39 45 50 29 43 28 46 40 38 34 30 44 42
result:
ok 50 numbers
Test #109:
score: 0
Accepted
time: 1ms
memory: 3664kb
input:
50 644922296669127975
output:
1 3 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 43 29 39 35 31 49 37 33 30 28 45 32 50 47 36 44 41 42 34 46 40 38 48
result:
ok 50 numbers
Test #110:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
22 138697748786275802
output:
22 20 21 18 19 16 17 14 15 12 13 10 11 8 9 6 7 4 5 2 3 1
result:
ok 22 numbers
Test #111:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
22 138697748786275803
output:
-1
result:
ok 1 number(s): "-1"
Extra Test:
score: 0
Extra Test Passed