結果

問題 No.2732 Similar Permutations
ユーザー hitonanodehitonanode
提出日時 2024-04-19 21:39:45
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 67 ms / 2,000 ms
コード長 8,517 bytes
コンパイル時間 2,561 ms
コンパイル使用メモリ 198,376 KB
実行使用メモリ 8,960 KB
最終ジャッジ日時 2024-10-11 14:26:30
合計ジャッジ時間 18,368 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 20 ms
5,248 KB
testcase_03 AC 30 ms
6,400 KB
testcase_04 AC 10 ms
5,248 KB
testcase_05 AC 9 ms
5,248 KB
testcase_06 AC 6 ms
5,248 KB
testcase_07 AC 57 ms
5,632 KB
testcase_08 AC 12 ms
5,248 KB
testcase_09 AC 7 ms
5,248 KB
testcase_10 AC 52 ms
8,704 KB
testcase_11 AC 7 ms
5,248 KB
testcase_12 AC 54 ms
8,720 KB
testcase_13 AC 51 ms
8,844 KB
testcase_14 AC 50 ms
8,956 KB
testcase_15 AC 52 ms
8,784 KB
testcase_16 AC 40 ms
7,340 KB
testcase_17 AC 35 ms
7,108 KB
testcase_18 AC 45 ms
8,452 KB
testcase_19 AC 50 ms
8,852 KB
testcase_20 AC 51 ms
8,820 KB
testcase_21 AC 50 ms
8,840 KB
testcase_22 AC 28 ms
6,500 KB
testcase_23 AC 52 ms
8,708 KB
testcase_24 AC 31 ms
6,520 KB
testcase_25 AC 56 ms
8,712 KB
testcase_26 AC 42 ms
7,928 KB
testcase_27 AC 53 ms
8,712 KB
testcase_28 AC 58 ms
7,476 KB
testcase_29 AC 67 ms
8,840 KB
testcase_30 AC 39 ms
7,152 KB
testcase_31 AC 49 ms
8,672 KB
testcase_32 AC 47 ms
8,340 KB
testcase_33 AC 53 ms
8,716 KB
testcase_34 AC 34 ms
6,884 KB
testcase_35 AC 50 ms
8,708 KB
testcase_36 AC 48 ms
8,460 KB
testcase_37 AC 51 ms
8,708 KB
testcase_38 AC 45 ms
8,120 KB
testcase_39 AC 50 ms
8,712 KB
testcase_40 AC 44 ms
7,804 KB
testcase_41 AC 50 ms
8,840 KB
testcase_42 AC 37 ms
7,292 KB
testcase_43 AC 50 ms
8,716 KB
testcase_44 AC 26 ms
6,168 KB
testcase_45 AC 50 ms
8,712 KB
testcase_46 AC 44 ms
8,172 KB
testcase_47 AC 48 ms
8,708 KB
testcase_48 AC 30 ms
6,700 KB
testcase_49 AC 49 ms
8,716 KB
testcase_50 AC 29 ms
6,580 KB
testcase_51 AC 47 ms
8,840 KB
testcase_52 AC 40 ms
7,964 KB
testcase_53 AC 49 ms
8,960 KB
testcase_54 AC 50 ms
8,732 KB
testcase_55 AC 49 ms
8,864 KB
testcase_56 AC 52 ms
8,704 KB
testcase_57 AC 27 ms
6,144 KB
testcase_58 AC 35 ms
7,104 KB
testcase_59 AC 33 ms
6,912 KB
testcase_60 AC 28 ms
6,400 KB
testcase_61 AC 26 ms
6,272 KB
testcase_62 AC 42 ms
7,936 KB
testcase_63 AC 2 ms
5,248 KB
testcase_64 AC 2 ms
5,248 KB
testcase_65 AC 2 ms
5,248 KB
testcase_66 AC 2 ms
5,248 KB
testcase_67 AC 2 ms
5,248 KB
testcase_68 AC 2 ms
5,248 KB
testcase_69 AC 2 ms
5,248 KB
testcase_70 AC 2 ms
5,248 KB
testcase_71 AC 1 ms
5,248 KB
testcase_72 AC 2 ms
5,248 KB
testcase_73 AC 2 ms
5,248 KB
testcase_74 AC 2 ms
5,248 KB
testcase_75 AC 2 ms
5,248 KB
testcase_76 AC 2 ms
5,248 KB
testcase_77 AC 2 ms
5,248 KB
testcase_78 AC 3 ms
5,248 KB
testcase_79 AC 2 ms
5,248 KB
testcase_80 AC 2 ms
5,248 KB
testcase_81 AC 2 ms
5,248 KB
testcase_82 AC 2 ms
5,248 KB
testcase_83 AC 2 ms
5,248 KB
testcase_84 AC 2 ms
5,248 KB
testcase_85 AC 2 ms
5,248 KB
testcase_86 AC 2 ms
5,248 KB
testcase_87 AC 2 ms
5,248 KB
testcase_88 AC 2 ms
5,248 KB
testcase_89 AC 2 ms
5,248 KB
testcase_90 AC 2 ms
5,248 KB
testcase_91 AC 2 ms
5,248 KB
testcase_92 AC 2 ms
5,248 KB
testcase_93 AC 2 ms
5,248 KB
testcase_94 AC 2 ms
5,248 KB
testcase_95 AC 2 ms
5,248 KB
testcase_96 AC 2 ms
5,248 KB
testcase_97 AC 2 ms
5,248 KB
testcase_98 AC 2 ms
5,248 KB
testcase_99 AC 2 ms
5,248 KB
testcase_100 AC 2 ms
5,248 KB
testcase_101 AC 2 ms
5,248 KB
testcase_102 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


pair<vector<int>, vector<int>> solve(vector<int> A) {
    const int N = A.size();

    if (N < 11) {
        vector<int> P(N);
        REP(i, N) P.at(i) = i + 1;

        map<int, vector<int>> mp;

        do {
            int score = 0;
            REP(i, N) score ^= P.at(i) + A.at(i);
            if (mp.count(score)) return {mp.at(score), P};
            mp[score] = P;
        } while (next_permutation(ALL(P)));

        return {{}, {}};
    }
    vector<vector<int>> md4s(4);
    REP(i, N) md4s.at(A.at(i) % 4).push_back(i);

    REP(d, 4) {
        if (md4s.at(d).size() >= 2) {
            const int i = md4s.at(d).at(0), j = md4s.at(d).at(1);
            vector<int> ret(N);
            vector<int> ret2(N);
            FOR(u, 1, 8) FOR(v, 1, 8) {
                if (u == v) continue;
                ret.at(i) = u;
                ret.at(j) = v;
                ret2.at(i) = v;
                ret2.at(j) = u;

                int nxt = 1;
                REP(t, N) {
                    if (ret.at(t)) continue;

                    if (nxt == u) ++nxt;
                    if (nxt == v) ++nxt;
                    if (nxt == u) ++nxt;
                    ret.at(t) = nxt;
                    ret2.at(t) = nxt;
                    ++nxt;
                }

                int sumdiff = 0;
                REP(t, N) {
                    sumdiff ^= ret.at(t) + A.at(t);
                    sumdiff ^= ret2.at(t) + A.at(t);
                }

                if (!sumdiff) {
                    return {ret, ret2};
                }
            }
        }
    }

    assert(false);
}

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;

    dbg(A);

    auto [ret, ret2] = solve(A);
    if (ret.empty()) {
        puts("-1");
    } else {
        REP(i, N) cout << ret.at(i) << (i + 1 == N ? '\n' : ' ');
        REP(i, N) cout << ret2.at(i) << (i + 1 == N ? '\n' : ' ');
    }
}
0