結果

問題 No.2732 Similar Permutations
ユーザー coindarwcoindarw
提出日時 2024-04-19 23:38:33
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 60 ms / 2,000 ms
コード長 5,767 bytes
コンパイル時間 6,115 ms
コンパイル使用メモリ 310,640 KB
実行使用メモリ 30,092 KB
最終ジャッジ日時 2024-10-11 18:23:25
合計ジャッジ時間 20,520 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
26,752 KB
testcase_01 AC 11 ms
26,624 KB
testcase_02 AC 25 ms
27,776 KB
testcase_03 AC 36 ms
28,600 KB
testcase_04 AC 19 ms
27,392 KB
testcase_05 AC 18 ms
27,136 KB
testcase_06 AC 13 ms
26,880 KB
testcase_07 AC 30 ms
28,232 KB
testcase_08 AC 21 ms
27,392 KB
testcase_09 AC 15 ms
27,136 KB
testcase_10 AC 57 ms
29,944 KB
testcase_11 AC 14 ms
27,136 KB
testcase_12 AC 57 ms
30,092 KB
testcase_13 AC 60 ms
30,088 KB
testcase_14 AC 58 ms
29,964 KB
testcase_15 AC 57 ms
30,088 KB
testcase_16 AC 45 ms
29,232 KB
testcase_17 AC 43 ms
28,960 KB
testcase_18 AC 55 ms
29,644 KB
testcase_19 AC 59 ms
29,960 KB
testcase_20 AC 57 ms
29,952 KB
testcase_21 AC 57 ms
29,964 KB
testcase_22 AC 36 ms
28,604 KB
testcase_23 AC 57 ms
30,092 KB
testcase_24 AC 38 ms
28,612 KB
testcase_25 AC 58 ms
30,092 KB
testcase_26 AC 49 ms
29,568 KB
testcase_27 AC 57 ms
30,092 KB
testcase_28 AC 46 ms
29,276 KB
testcase_29 AC 59 ms
30,088 KB
testcase_30 AC 43 ms
29,092 KB
testcase_31 AC 57 ms
29,968 KB
testcase_32 AC 57 ms
29,772 KB
testcase_33 AC 57 ms
29,964 KB
testcase_34 AC 42 ms
28,796 KB
testcase_35 AC 58 ms
30,092 KB
testcase_36 AC 54 ms
29,776 KB
testcase_37 AC 58 ms
29,968 KB
testcase_38 AC 52 ms
29,472 KB
testcase_39 AC 58 ms
29,964 KB
testcase_40 AC 50 ms
29,452 KB
testcase_41 AC 57 ms
29,964 KB
testcase_42 AC 44 ms
29,124 KB
testcase_43 AC 57 ms
30,088 KB
testcase_44 AC 35 ms
28,436 KB
testcase_45 AC 57 ms
30,016 KB
testcase_46 AC 53 ms
29,632 KB
testcase_47 AC 56 ms
29,964 KB
testcase_48 AC 39 ms
28,892 KB
testcase_49 AC 56 ms
30,044 KB
testcase_50 AC 37 ms
28,760 KB
testcase_51 AC 54 ms
29,964 KB
testcase_52 AC 47 ms
29,464 KB
testcase_53 AC 58 ms
29,964 KB
testcase_54 AC 57 ms
29,964 KB
testcase_55 AC 57 ms
29,964 KB
testcase_56 AC 57 ms
29,964 KB
testcase_57 AC 36 ms
28,436 KB
testcase_58 AC 44 ms
29,088 KB
testcase_59 AC 42 ms
28,932 KB
testcase_60 AC 37 ms
28,596 KB
testcase_61 AC 36 ms
28,428 KB
testcase_62 AC 53 ms
29,572 KB
testcase_63 AC 12 ms
26,616 KB
testcase_64 AC 11 ms
26,624 KB
testcase_65 AC 10 ms
26,672 KB
testcase_66 AC 13 ms
26,712 KB
testcase_67 AC 12 ms
26,624 KB
testcase_68 AC 12 ms
26,624 KB
testcase_69 AC 12 ms
26,624 KB
testcase_70 AC 11 ms
26,676 KB
testcase_71 AC 11 ms
26,616 KB
testcase_72 AC 12 ms
26,704 KB
testcase_73 AC 10 ms
26,624 KB
testcase_74 AC 12 ms
26,624 KB
testcase_75 AC 11 ms
26,752 KB
testcase_76 AC 11 ms
26,752 KB
testcase_77 AC 12 ms
26,624 KB
testcase_78 AC 11 ms
26,616 KB
testcase_79 AC 12 ms
26,752 KB
testcase_80 AC 10 ms
26,624 KB
testcase_81 AC 11 ms
26,752 KB
testcase_82 AC 12 ms
26,624 KB
testcase_83 AC 11 ms
26,612 KB
testcase_84 AC 12 ms
26,752 KB
testcase_85 AC 10 ms
26,636 KB
testcase_86 AC 12 ms
26,624 KB
testcase_87 AC 11 ms
26,624 KB
testcase_88 AC 12 ms
26,624 KB
testcase_89 AC 12 ms
26,752 KB
testcase_90 AC 11 ms
26,624 KB
testcase_91 AC 11 ms
26,624 KB
testcase_92 AC 12 ms
26,752 KB
testcase_93 AC 11 ms
26,752 KB
testcase_94 AC 12 ms
26,752 KB
testcase_95 AC 11 ms
26,696 KB
testcase_96 AC 11 ms
26,736 KB
testcase_97 AC 11 ms
26,672 KB
testcase_98 AC 11 ms
26,624 KB
testcase_99 AC 12 ms
26,624 KB
testcase_100 AC 12 ms
26,752 KB
testcase_101 AC 11 ms
26,752 KB
testcase_102 AC 11 ms
26,624 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>

#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif

using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;

// clang-format off
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}

template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }

template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}

inline string YESNO(bool cond) { return cond ? "YES" : "NO"; }inline string yesno(bool cond) { return cond ? "yes" : "no"; }inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif

#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    inp(n);
    vector<int> a(n);
    inp(a);

    int mx = *max_element(all(a));
    vector<vector<int>> hatonosu = vector<vector<int>>(1000000, vector<int>());
    int m = min(n, 10);
    vector<int> ans(m);
    iota(all(ans), 0);
    do {
        int ax = 0;
        rep(i, m) ax ^= a[i] + ans[i] + 1;
        if (hatonosu.at(ax).empty()) {
            hatonosu.at(ax) = ans;
        } else {
            auto ans2 = hatonosu.at(ax);
            rep2(i, m, n) {
                ans.push_back(i);
                ans2.push_back(i);
            }
            oup(add1(ans));
            oup(add1(ans2));
            return 0;
        }
        hatonosu.at(ax) = ans;
    } while (next_permutation(all(ans)));

    oup(-1);
    return 0;
}
0