結果

問題 No.2732 Similar Permutations
ユーザー coindarwcoindarw
提出日時 2024-04-19 22:26:06
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,460 bytes
コンパイル時間 5,717 ms
コンパイル使用メモリ 313,088 KB
実行使用メモリ 17,956 KB
最終ジャッジ日時 2024-10-11 15:56:17
合計ジャッジ時間 25,833 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 6 ms
11,008 KB
testcase_02 AC 30 ms
13,236 KB
testcase_03 WA -
testcase_04 AC 19 ms
12,232 KB
testcase_05 WA -
testcase_06 AC 9 ms
11,416 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 79 ms
11,392 KB
testcase_13 AC 81 ms
11,520 KB
testcase_14 AC 82 ms
11,520 KB
testcase_15 AC 81 ms
11,520 KB
testcase_16 AC 59 ms
10,752 KB
testcase_17 AC 58 ms
10,752 KB
testcase_18 AC 77 ms
11,264 KB
testcase_19 AC 86 ms
11,520 KB
testcase_20 AC 79 ms
11,392 KB
testcase_21 AC 76 ms
10,752 KB
testcase_22 AC 49 ms
9,728 KB
testcase_23 AC 68 ms
10,240 KB
testcase_24 AC 44 ms
9,344 KB
testcase_25 AC 63 ms
10,200 KB
testcase_26 AC 55 ms
9,728 KB
testcase_27 AC 62 ms
10,204 KB
testcase_28 AC 50 ms
9,600 KB
testcase_29 AC 57 ms
10,076 KB
testcase_30 AC 43 ms
9,472 KB
testcase_31 AC 57 ms
10,112 KB
testcase_32 AC 54 ms
9,600 KB
testcase_33 AC 57 ms
10,112 KB
testcase_34 AC 38 ms
9,340 KB
testcase_35 AC 58 ms
9,984 KB
testcase_36 AC 53 ms
9,472 KB
testcase_37 AC 56 ms
9,984 KB
testcase_38 AC 49 ms
9,472 KB
testcase_39 AC 57 ms
9,856 KB
testcase_40 AC 47 ms
9,472 KB
testcase_41 AC 57 ms
9,600 KB
testcase_42 AC 44 ms
9,216 KB
testcase_43 AC 56 ms
9,556 KB
testcase_44 AC 31 ms
8,960 KB
testcase_45 AC 56 ms
9,616 KB
testcase_46 AC 50 ms
9,408 KB
testcase_47 AC 55 ms
9,672 KB
testcase_48 AC 35 ms
8,960 KB
testcase_49 AC 54 ms
9,472 KB
testcase_50 AC 35 ms
8,832 KB
testcase_51 AC 53 ms
7,944 KB
testcase_52 AC 46 ms
7,952 KB
testcase_53 AC 83 ms
12,672 KB
testcase_54 AC 82 ms
12,672 KB
testcase_55 AC 82 ms
12,672 KB
testcase_56 AC 82 ms
12,672 KB
testcase_57 AC 47 ms
10,880 KB
testcase_58 AC 59 ms
11,640 KB
testcase_59 AC 59 ms
11,392 KB
testcase_60 AC 47 ms
10,880 KB
testcase_61 AC 45 ms
10,624 KB
testcase_62 AC 71 ms
12,032 KB
testcase_63 AC 6 ms
11,100 KB
testcase_64 AC 8 ms
11,028 KB
testcase_65 AC 7 ms
10,968 KB
testcase_66 AC 6 ms
10,880 KB
testcase_67 AC 8 ms
10,968 KB
testcase_68 AC 7 ms
10,972 KB
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
testcase_72 WA -
testcase_73 WA -
testcase_74 WA -
testcase_75 WA -
testcase_76 WA -
testcase_77 WA -
testcase_78 WA -
testcase_79 WA -
testcase_80 WA -
testcase_81 WA -
testcase_82 WA -
testcase_83 WA -
testcase_84 WA -
testcase_85 WA -
testcase_86 WA -
testcase_87 WA -
testcase_88 WA -
testcase_89 WA -
testcase_90 WA -
testcase_91 WA -
testcase_92 WA -
testcase_93 WA -
testcase_94 WA -
testcase_95 WA -
testcase_96 WA -
testcase_97 WA -
testcase_98 WA -
testcase_99 WA -
testcase_100 WA -
testcase_101 WA -
testcase_102 WA -
権限があれば一括ダウンロードができます

ソースコード

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>> idx = vector<vector<int>>(mx + 1, vector<int>());
        rep(i, n) idx[a[i]].push_back(i);
        int x = -1;
        rep(i, mx + 1) {
            if (idx[i].size() >= 2) {
                x = i;
                break;
            }
        }
        debug(x);
        if (x != -1) {
            reps(i, n) cout << i << " ";
            cout << "\n";
            int c = 0;
            rep(i, n) {
                if (a[i] == x) {
                    cout << idx[x][idx[x].size() - (++c)] + 1 << " ";
                } else {
                    cout << i + 1 << " ";
                }
            }
            cout << "\n";
            return 0;
        }
    }

    using P = pair<int, int>;
    int N = 1;
    while (N <= n) N *= 2;
    vector<P> hatonosu(1e6, {-1, -1});
    vector<int> ans(n);
    iota(all(ans), 0);
    rep(i, n) {
        reps(j, n) {
            int sum = j + a[i];
            if (hatonosu.at(sum).first == -1) {
                hatonosu.at(sum) = {i, j};
                continue;
            }
            auto [x, y] = hatonosu.at(sum);
            if (x == i) continue;

            vector<int> ans;
            rep(k, n) {
                if (k != i && k != x) {
                    ans.push_back(k);
                }
            }

            debug(i, j, x, y, sum);
            debug(ans);
            // a[x]をy番目に，a[i]をj番目に
            auto a1 = ans;
            rep(k, n) {
                if (k != y - 1 && k != j - 1) {
                    cout << a1.back() + 1 << " ";
                    a1.pop_back();
                } else if (k == y - 1) {
                    cout << i + 1 << " ";
                } else if (k == j - 1) {
                    cout << x + 1 << " ";
                }
            }
            cout << "\n";
            // a[x]をj番目に，a[i]をy番目に
            auto a2 = ans;
            rep(k, n) {
                if (k != y - 1 && k != j - 1) {
                    cout << a2.back() + 1 << " ";
                    a2.pop_back();
                } else if (k == y - 1) {
                    cout << x + 1 << " ";
                } else if (k == j - 1) {
                    cout << i + 1 << " ";
                }
            }
            cout << "\n";
            return 0;
        }
    }
    oup(-1);
    return 0;
}
0